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

arXiv:2404.00539v1 Announce Type: new
Abstract: 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 …

abstract arxiv cs.lg graph heuristics instances networks np-hard optimization practical reinforcement reinforcement learning solutions stage type