Machine Learning Constructives and Local Searches for the Travelling Salesman Problem
Not on the map. Why?
Abstract (arXiv)
The ML-Constructive heuristic is a recently presented method and the first hybrid method capable of scaling up to real scale traveling salesman problems. It combines machine learning techniques and classic optimization techniques. In this paper we present improvements to the computational weight of the original deep learning model. In addition, as simpler models reduce the execution time, the possibility of adding a local-search phase is explored to further improve performance. Experimental results corroborate the quality of the proposed improvements.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 7 of its 21 references that are in the map. First posted on arXiv 2 Aug 2021.
Builds on
7 of 21 references.
References · 7
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
- 2018Attention, Learn to Solve Routing Problems!cited by 656
- 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 623
- 2018Deep Learning: A Critical Appraisalcited by 217
- 2020Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instancescited by 162
- 2021Learning to Sparsify Travelling Salesman Problem Instancescited by 9
Built on by
Citing papers per year: 2021: 1.
1 paper.