Efficient Neural Combinatorial Optimization Solver for the Min-max Heterogeneous Capacitated Vehicle Routing Problem
Xuan Wu, Di Wang, Chunguo Wu, Kaifang Qi, Chunyan Miao, Yubin Xiao, Jian Zhang, You Zhou

TL;DR
This paper introduces ECHO, an efficient neural solver for the complex min-max heterogeneous capacitated vehicle routing problem, addressing limitations of previous methods by capturing local topology, avoiding myopic decisions, and leveraging symmetry for improved performance.
Contribution
ECHO employs a dual-modality node encoder, a parameter-free cross-attention mechanism, and a data augmentation strategy to enhance neural combinatorial optimization for MMHCVRP, outperforming existing solvers.
Findings
ECHO outperforms state-of-the-art NCO solvers across various scenarios.
ECHO generalizes well across different scales and distributions.
Ablation studies confirm the effectiveness of each proposed component.
Abstract
Numerous Neural Combinatorial Optimization (NCO) solvers have been proposed to address Vehicle Routing Problems (VRPs). However, most of these solvers focus exclusively on single-vehicle VRP variants, overlooking the more realistic min-max Heterogeneous Capacitated Vehicle Routing Problem (MMHCVRP), which involves multiple vehicles. Existing MMHCVRP solvers typically select a vehicle and its next node to visit at each decoding step, but often make myopic decoding decisions and overlook key properties of MMHCVRP, including local topological relationships, vehicle permutation invariance, and node symmetry, resulting in suboptimal performance. To better address these limitations, we propose ECHO, an efficient NCO solver. First, ECHO exploits the proposed dual-modality node encoder to capture local topological relationships among nodes. Subsequently, to mitigate myopic decisions, ECHO…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
