21 citations · 73 across the 25 of their papers we have counts for
7 papers · 1 filter
URS: A Unified Neural Routing Solver for Cross-Problem Zero-Shot Generalization
Changliang Zhou, Canhong Yu, Shunyu Yao +4
Multi-task neural routing solvers have emerged as a promising paradigm for their ability to solve multiple vehicle routing problems (VRPs) using a single model. However, existing n…
LRM-1B: Towards Large Routing Model
Han Li, Fei Liu, Zhenkun Wang +1
Vehicle routing problems (VRPs) are central to combinatorial optimization with significant practical implications. Recent advancements in neural combinatorial optimization (NCO) ha…
Learning to Insert for Constructive Neural Vehicle Routing Solver
Fu Luo, Xi Lin, Mengyuan Zhong +4
Neural Combinatorial Optimisation (NCO) is a promising learning-based approach for solving Vehicle Routing Problems (VRPs) without extensive manual design. While existing construct…
Learning to Reduce Search Space for Generalizable Neural Routing Solver
Changliang Zhou, Xi Lin, Zhenkun Wang +1
Constructive neural combinatorial optimization (NCO) offers a promising paradigm for solving vehicle routing problems (VRPs) by directly learning to construct approximate optimal s…
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…
Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design
Zhi Zheng, Zhuoliang Xie, Zhenkun Wang +1
Handcrafting heuristics for solving complex optimization tasks (e.g., route planning and task allocation) is a common practice but requires extensive domain knowledge. Recently, La…
MOS-Attack: A Scalable Multi-objective Adversarial Attack Framework
Ping Guo, Cheng Gong, Xi Lin +4
Crafting adversarial examples is crucial for evaluating and enhancing the robustness of Deep Neural Networks (DNNs), presenting a challenge equivalent to maximizing a non-different…