arXiv:2601. 01665v2 Announce Type: replace-cross Abstract: Deep reinforcement learning (DRL) has shown great promise in addressing multi-objective combinatorial optimization problems (MOCOPs).
By Wei Liu, Yaoxin Wu, Yingqian Zhang, Thomas B\"ack, Yingjie Fan
arXiv:2506. 02594v2 Announce Type: replace Abstract: Large language models (LLMs) are increasingly used to synthesize heuristic programs, yet most existing pipelines optimize solvers against fixed benchmark distributions.
By Ruibo Duan, Yuxin Liu, Haoran Ye, Xinyao Dong, Zhiqiang Xu, Chenglin Fan
arXiv:2608. 07544v1 Announce Type: cross Abstract: Automated heuristic design (AHD) with large language models (LLMs) has produced strong heuristics for combinatorial optimization problems (COPs).
By Oguzhan Gungordu, Siheng Xiong, Faramarz Fekri
arXiv:2608. 06808v1 Announce Type: new Abstract: The Automatic Construction of Portfolios via Large Language Models (LLM-ACP) suffers from poor generalization in practical few-shot scenarios when solving complex combinatorial optimization problems.
By Shaofeng Zhang, Shengcai Liu, Zhiyuan Wang, Ke Tang
arXiv:2602. 23092v2 Announce Type: replace Abstract: The Capacitated Vehicle Routing Problem (CVRP), a fundamental combinatorial optimization challenge, focuses on optimizing fleet operations under vehicle capacity constraints.
By Zhuoliang Xie, Fei Liu, Zhenkun Wang, Qingfu Zhang
arXiv:2608. 03129v1 Announce Type: new Abstract: Large Language Model-assisted Evolutionary Search (LES) has emerged as a powerful paradigm for automated algorithm design.
By Qinglong Hu, Qingfu Zhang, Fei Liu, Xialiang Tong, Kun Mao, Mingxuan Yuan
arXiv:2608. 12679v1 Announce Type: new Abstract: Large Language Models (LLMs) are increasingly deployed in discovery domains such as math and science.
By Conor F. Hayes, Elliot Meyerson, Kajetan Schweighofer, Roberto Dailey, Babak Hodjat, Risto Miikkulainen, Xin Qiu
arXiv:2501. 17377v4 Announce Type: replace-cross Abstract: Deep Reinforcement Learning (DRL) has emerged as a promising approach for solving Combinatorial Optimization (CO) problems, such as the 3D Bin Packing Problem (3D-BPP), Traveling Salesman Problem (TSP), or Vehicle Routing Problem (VRP), but these neural solvers often exhibit brittleness when facing distribution shifts.
By Han Fang, Paul Weng, Yutong Ban
arXiv:2405. 01906v3 Announce Type: replace Abstract: In modern intelligent transportation systems (ITS), particularly in freight transportation and logistics, real-time route planning is crucial.
By Changliang Zhou, Xi Lin, Zhenkun Wang, Xialiang Tong, Mingxuan Yuan, Qingfu Zhang
arXiv:2605. 00369v4 Announce Type: replace-cross Abstract: We study how large language models can be used to generate inventory policies in online settings with non-stationary demand.
By Chenyu Huang, Jianghao Lin, Zhengyang Tang, Bo Jiang, Ruoqing Jiang, Benyou Wang, Lai Wei
arXiv:2607. 23676v1 Announce Type: new Abstract: LLM-based automated heuristic design (AHD) typically scores executable programs on complete instances or within fixed solver components.
By Kezhao Lai, Yutao Lai, Hai-Lin Liu
arXiv:2603. 27628v2 Announce Type: replace Abstract: In dynamic flexible job shops, order arrivals, machine breakdowns, and processing-time deviations continually reshape the scheduling state and the priority trade-offs behind dispatching decisions.
By XinLei Zhou, Jin Huang, Jie Yang, Xinyu Li, Liang Gao