In order to deal with the high development time of exact and approximation algorithms for NP-hard combinatorial optimisation problems and the high running time of exact solvers, deep learning techniques have been used in recent years as an end-to-end approach to find solutions. However, there are issues of representation, generalisation, complex architectures, interpretability of models for mathematical analysis etc. using deep learning techniques. As a compromise, machine learning can be used to improve the run time performance of exact algorithms in a matheuristics framework. In this paper, we use a pruning heuristic leveraging machine learning as a pre-processing step followed by an exact Integer Programming approach. We apply this approach to sparsify instances of the classical travelling salesman problem. Our approach learns which edges in the underlying graph are unlikely to belong to an optimal solution and removes them, thus sparsifying the graph and significantly reducing the number of decision variables. We use carefully selected features derived from linear programming relaxation, cutting planes exploration, minimum-weight spanning tree heuristics and various other local and statistical analysis of the graph. Our learning approach requires very little training data and is amenable to mathematical analysis. We demonstrate that our approach can reliably prune a large fraction of the variables in TSP instances from TSPLIB/MATILDA (>85%$) while preserving most of the optimal tour edges. Our approach can successfully prune problem instances even if they lie outside the training distribution, resulting in small optimality gaps between the pruned and original problems in most cases. Using our learning technique, we discover novel heuristics for sparsifying TSP instances, that may be of independent interest for variants of the vehicle routing problem.
Machine Learning Constructives and Local Searches for the Travelling Salesman Problem
Università della Svizzera Italiana(瑞士意大利语区大学);Dalle Molle Institute for Artificial Intelligence(达莱莫勒人工智能研究所);University of Modena and Reggio Emilia(摩德纳-雷焦艾米利亚大学)
Diversity Optimization for Travelling Salesman Problem via Deep Reinforcement Learning
South China University of Technology(华南理工大学);Singapore Management University(新加坡管理大学);Massachusetts Institute of Technology(麻省理工学院);Eindhoven University of Technology(埃因霍温理工大学)
HeatACO: A Heatmap-Guided Max--Min Ant System for Large-Scale Travelling Salesman Problems
Centre for Data Science;Artificial Intelligence \& the School of Engineering;Computer Science, Victoria University of Wellington, Wellington, 6140, New Zealand
Machine Learning-based Two-Stage Graph Sparsification for the Travelling Salesman Problem
Centre for Data Science and Artificial Intelligence(数据科学与人工智能中心);School of Engineering and Computer Science(工程与计算机科学学院);Victoria University of Wellington(惠灵顿维多利亚大学)
University of Latvia(拉脱维亚大学);Institute of Mathematics and Computer Science at University of Latvia(拉脱维亚大学数学与计算机科学研究所);Institute of Electronics and Computer Science(电子与计算机科学研究所)