arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.09345cs.LG
收藏

学习稀疏化旅行推销员问题

Learning to Sparsify Travelling Salesman Problem Instances

University College Dublin(都柏林大学学院)

James Fitzpatrick, Deepak Ajwani, Paula Carroll

摘要:

为了应对NP难组合优化问题的精确和近似算法的高开发时间以及精确求解器的高运行时间,近年来已使用深度学习技术作为端到端方法来寻找解决方案。然而,使用深度学习技术存在表示、泛化、复杂架构、数学分析模型的可解释性等问题。作为一种折衷方案,机器学习可以用于提高数学框架中精确算法的运行时间性能。在本文中,我们使用一个修剪启发式利用机器学习作为预处理步骤,其次是一个精确的可编程方法。我们应用这种方法来稀疏的经典旅行推销员问题的例子。我们的方法学习底层图中的哪些边不太可能属于最优解,并将其删除,从而使图稀疏化并显着减少决策变量的数量。我们使用精心挑选的功能来自线性规划放松,切割平面探索,最小重量生成树算法和各种其他本地和统计分析的图形。我们的学习方法只需要很少的训练数据,并且易于进行数学分析。我们证明,我们的方法可以可靠地修剪大部分的变量在TSP实例从TSPLIB/MATILDA(> 85%$),同时保留最佳的旅游边缘。我们的方法可以成功地修剪问题实例,即使它们位于训练分布之外,在大多数情况下,修剪和原始问题之间的最优性差距很小。使用我们的学习技术,我们发现了新的稀疏TSP的实例,这可能是独立的兴趣的车辆路径问题的变体。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑