Neural Combinatorial Optimization with Heavy Decoder: Toward Large Scale Generalization
Fu Luo, Xi Lin, Fei Liu, Qingfu Zhang, Zhenkun Wang

TL;DR
This paper introduces the LEHD model, a neural network architecture with a lightweight encoder and a heavy decoder, capable of solving large-scale combinatorial optimization problems like TSP and CVRP with high accuracy and generalization from small training instances.
Contribution
The paper proposes the LEHD model with a novel architecture and training scheme that enables large-scale problem solving and better generalization in neural combinatorial optimization.
Findings
LEHD solves TSP and CVRP with up to 1000 nodes.
LEHD generalizes well to real-world problem instances.
LEHD outperforms existing state-of-the-art methods.
Abstract
Neural combinatorial optimization (NCO) is a promising learning-based approach for solving challenging combinatorial optimization problems without specialized algorithm design by experts. However, most constructive NCO methods cannot solve problems with large-scale instance sizes, which significantly diminishes their usefulness for real-world applications. In this work, we propose a novel Light Encoder and Heavy Decoder (LEHD) model with a strong generalization ability to address this critical issue. The LEHD model can learn to dynamically capture the relationships between all available nodes of varying sizes, which is beneficial for model generalization to problems of various scales. Moreover, we develop a data-efficient training scheme and a flexible solution construction mechanism for the proposed LEHD model. By training on small-scale problem instances, the LEHD model can generate…
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.
Code & Models
Videos
Taxonomy
TopicsVehicle Routing Optimization Methods · Metaheuristic Optimization Algorithms Research
