How Good Is Neural Combinatorial Optimization? A Systematic Evaluation on the Traveling Salesman Problem
Shengcai Liu, Yu Zhang, Ke Tang, Xin Yao

TL;DR
This paper systematically evaluates neural combinatorial optimization (NCO) methods for the traveling salesman problem, comparing them to traditional solvers across effectiveness, efficiency, stability, scalability, and generalization.
Contribution
It provides the first comprehensive empirical comparison of NCO and traditional solvers, highlighting the strengths and weaknesses of NCO approaches.
Findings
NCO solvers generally underperform compared to traditional methods.
NCO approaches are more time and energy efficient for small instances with ample training data.
Traditional solvers excel in effectiveness, stability, and scalability.
Abstract
Traditional solvers for tackling combinatorial optimization (CO) problems are usually designed by human experts. Recently, there has been a surge of interest in utilizing deep learning, especially deep reinforcement learning, to automatically learn effective solvers for CO. The resultant new paradigm is termed neural combinatorial optimization (NCO). However, the advantages and disadvantages of NCO relative to other approaches have not been empirically or theoretically well studied. This work presents a comprehensive comparative study of NCO solvers and alternative solvers. Specifically, taking the traveling salesman problem as the testbed problem, the performance of the solvers is assessed in five aspects, i.e., effectiveness, efficiency, stability, scalability, and generalization ability. Our results show that the solvers learned by NCO approaches, in general, still fall short of…
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.
Taxonomy
TopicsMetaheuristic Optimization Algorithms Research
