arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2101.09629math.OC
收藏

解决大规模QAP的并行问题

Solving Challenging Large Scale QAPs

Koichi Fujii, Naoki Ito, Sunyoung Kim, Masakazu Kojima, Yuji Shinano, Kim-Chuan Toh

摘要:

本文报告了我们在解决大规模二次指派问题(QAP)方面的研究进展。我们解决大规模NP难组合最优化问题(如QAP)的主要方法是使用Ubiquity Generator(UG)框架在功能强大的计算机系统上有效实现的并行分支定界法,该框架可以使用超过100,000个核心。在分支定界法中引入的下界方法在求解问题中起着至关重要的作用。对于一个强的下界程序,我们采用拉格朗日双非负(DNN)松弛和牛顿括号方法开发的作者的小组。在这份报告中,我们描述了一些基本的工具,包括在项目中使用的下界程序和分支规则,并提出了一些初步的数值结果。我们的下一个目标问题是维度至少为50的QAP,因为我们已经成功地解决了QAPLIB中的tai30a和sko42。

英文摘要:

We report our progress on the project for solving larger scale quadratic assignment problems (QAPs). Our main approach to solve large scale NP-hard combinatorial optimization problems such as QAPs is a parallel branch-and-bound method efficiently implemented on a powerful computer system using the Ubiquity Generator (UG) framework that can utilize more than 100,000 cores. Lower bounding procedures incorporated in the branch-and-bound method play a crucial role in solving the problems. For a strong lower bounding procedure, we employ the Lagrangian doubly nonnegative (DNN) relaxation and the Newton-bracketing method developed by the authors' group. In this report, we describe some basic tools used in the project including the lower bounding procedure and branching rules, and present some preliminary numerical results. Our next target problem is QAPs with dimension at least 50, as we have succeeded to solve tai30a and sko42 from QAPLIB for the first time.

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

↑