activity
20202026
most citedLarge Language Model for Multi-objective Evolutionary Optimization

21 citations · 89 across the 23 of their papers we have counts for

collaborators
Showing cs.AIShow all

12 papers · 1 filter

cs.AI2026

AlgoEvo: Self-Evolving Agentic Search for Automated Algorithm Discovery

Junhao Qiu, Qinglong Hu, Xialiang Tong +4

Large language models have advanced automated algorithm discovery by synthesizing executable code, but existing frameworks trap them in rigid search pipelines with pre-defined cont…

cs.AI2026

Hyper-ES: Effective Evolution Strategies for LLM Reasoning via Descent Direction Merging

Yu Gu, Zhi Zheng, Yunpeng Ba +3

Evolution Strategy (ES) is a promising alternative to gradient-based fine-tuning for resource-constrained Large Language Model (LLM) reasoning. However, directly applying ES to bil…

cs.AI2026

Beyond Average Performance: Dynamic Instance Clustering and Specialized Algorithm Design in LLM-Assisted Evolutionary Search

Qinglong Hu, Qingfu Zhang, Fei Liu +3

Large Language Model-assisted Evolutionary Search (LES) has emerged as a powerful paradigm for automated algorithm design. However, existing LES methods primarily optimize for aver…

cs.AI2025

EoH-S: Evolution of Heuristic Set using LLMs for Automated Heuristic Design

Fei Liu, Yilu Liu, Qingfu Zhang +2

Automated Heuristic Design (AHD) using Large Language Models (LLMs) has achieved notable success in recent years. Despite the effectiveness of existing approaches, they only design…

cs.AI2025

Fitness Landscape of Large Language Model-Assisted Automated Algorithm Search

Fei Liu, Qingfu Zhang, Jialong Shi +3

Using Large Language Models (LLMs) in an evolutionary or other iterative search framework have demonstrated significant potential in automated algorithm design. However, the underl…

cs.AI2025

ARS: Automatic Routing Solver with Large Language Models

Kai Li, Fei Liu, Zhenkun Wang +4

Real-world Vehicle Routing Problems (VRPs) are characterized by a variety of practical constraints, making manual solver design both knowledge-intensive and time-consuming. Althoug…

cs.AI2024★ 2 cited

UDC: A Unified Neural Divide-and-Conquer Framework for Large-Scale Combinatorial Optimization Problems

Zhi Zheng, Changliang Zhou, Tong Xialiang +2

Single-stage neural combinatorial optimization solvers have achieved near-optimal results on various small-scale combinatorial optimization (CO) problems without requiring expert k…

cs.AI2024★ 3 cited

Instance-Conditioned Adaptation for Large-scale Generalization of Neural Routing Solver

Changliang Zhou, Xi Lin, Zhenkun Wang +3

In modern intelligent transportation systems (ITS), particularly in freight transportation and logistics, real-time route planning is crucial. It presents unique challenges driven…

cs.AI2023★ 19 cited

Heuristics for Vehicle Routing Problem: A Survey and Recent Advances

Fei Liu, Chengyu Lu, Lin Gui +3

Vehicle routing is a well-known optimization research topic with significant practical importance. Among different approaches to solving vehicle routing, heuristics can produce a s…

cs.AI2022★ 2 cited

A Data-Driven Column Generation Algorithm For Bin Packing Problem in Manufacturing Industry

Jiahui Duan, Xialiang Tong, Fei Ni +3

The bin packing problem exists widely in real logistic scenarios (e.g., packing pipeline, express delivery), with its goal to improve the packing efficiency and reduce the transpor…

cs.AI2022★ 5 cited

Introduction to The Dynamic Pickup and Delivery Problem Benchmark -- ICAPS 2021 Competition

Jianye Hao, Jiawen Lu, Xijun Li +4

The Dynamic Pickup and Delivery Problem (DPDP) is an essential problem within the logistics domain. So far, research on this problem has mainly focused on using artificial data whi…

cs.AI2020★ 1 cited

Bilevel Learning Model Towards Industrial Scheduling

Longkang Li, Hui-Ling Zhen, Mingxuan Yuan +5

Automatic industrial scheduling, aiming at optimizing the sequence of jobs over limited resources, is widely needed in manufacturing industries. However, existing scheduling system…