arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2406.03099cs.LGmath.OC
收藏

图卷积分支限界法的补充材料

Supplementary Materials to Graph Convolutional Branch and Bound

Department of Mathematics, University of Turin(都灵大学数学系);Department of Computer Science, University of Turin(都灵大学计算机科学系)

Lorenzo Sciandra, Roberto Esposito, Andrea Cesare Grosso, Laura Sacerdote, Cristina Zucca

AI总结:

本文提出利用神经网络学习启发式方法,结合图卷积神经网络提升旅行商问题求解效率,减少分支限界节点数量和计算时间。

摘要:

本文探讨将深度学习模型整合到组合优化流程中,特别是针对NP难问题。传统精确算法往往依赖启发式标准来指导可行解的探索。在本工作中,我们提出使用神经网络学习信息丰富的启发式方法,特别是用于估计解接近最优解的最优性分数。该分数用于评估分支限界框架内的节点,使解决方案空间的遍历更加高效。针对旅行商问题,我们引入了Concorde,一种最先进的求解器,并提出了一种称为图卷积分支限界的方法,该方法通过一种新颖的无监督训练策略训练图卷积神经网络,使其能够泛化到不同大小的图中,而无需标注数据。实验结果展示了所提方法的有效性,显示了探索的分支限界节点数量和总体计算时间的显著减少。有关1树松弛使用的部分结果见补充材料。

英文摘要:

This article explores the integration of deep learning models into combinatorial optimization pipelines, specifically targeting NP-hard problems. Traditional exact algorithms for such problems often rely on heuristic criteria to guide the exploration of feasible solutions. In this work, we propose using neural networks to learn informative heuristics, most notably, an optimality score that estimates a solution's proximity to the optimum. This score is used to evaluate nodes within a branch-and-bound framework, enabling a more efficient traversal of the solution space. Focusing on the Traveling Salesman Problem, we introduce Concorde, a state-of-the-art solver, and present a hybrid approach called Graph Convolutional Branch and Bound, which augments it with a graph convolutional neural network trained with a novel unsupervised training strategy that facilitates generalization to graphs of varying sizes without requiring labeled data. Empirical results demonstrate the effectiveness of the proposed method, showing a significant reduction in the number of explored branch-and-bound nodes and overall computational time. Some of the results concerning the use of the 1-tree relaxation are in the supplementary materials.

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

↑