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

通过两阶段图指针网络与强化学习求解二次分配问题

Solving the QAP by Two-Stage Graph Pointer Networks and Reinforcement Learning

Kyoto University(京都大学)

Satoko Iida, Ryota Yasudo

AI总结:

本文提出两阶段图指针网络(GPN)深度强化学习模型求解NP难的二次分配问题(QAP),通过扩展GPN至一般TSP并添加新算法,在TSPlib和QAPLIB基准上取得半最优解。

摘要:

二次分配问题(QAP)是一个已被研究多年的实用组合优化问题。由于它是NP难问题,求解大规模QAP实例具有挑战性。尽管启发式方法可以找到半最优解,但随着问题规模增大,执行时间显著增加。近年来,通过深度学习求解组合优化问题作为比启发式方法更快的求解器受到关注。然而,即使使用深度学习,求解大规模QAP仍然具有挑战性。在本文中,我们提出了一种称为两阶段图指针网络(GPN)的深度强化学习模型来求解QAP。两阶段GPN基于为欧几里得旅行商问题(TSP)提出的GPN。首先,我们将GPN扩展到一般TSP,然后向该模型添加新算法以求解QAP。我们的实验结果表明,我们的两阶段GPN为来自TSPlib和QAPLIB的基准问题实例提供了半最优解。

英文摘要:

Quadratic Assignment Problem (QAP) is a practical combinatorial optimization problems that has been studied for several years. Since it is NP-hard, solving large problem instances of QAP is challenging. Although heuristics can find semi-optimal solutions, the execution time significantly increases as the problem size increases. Recently, solving combinatorial optimization problems by deep learning has been attracting attention as a faster solver than heuristics. Even with deep learning, however, solving large QAP is still challenging. In this paper, we propose the deep reinforcement learning model called the two-stage graph pointer network (GPN) for solving QAP. Two-stage GPN relies on GPN, which has been proposed for Euclidean Traveling Salesman Problem (TSP). First, we extend GPN for general TSP, and then we add new algorithms to that model for solving QAP. Our experimental results show that our two-stage GPN provides semi-optimal solutions for benchmark problem instances from TSPlib and QAPLIB.

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

↑