arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2307.11248cs.DCcs.MS
收藏

二次分配问题的GPU加速并行求解方案

GPU-accelerated Parallel Solutions to the Quadratic Assignment Problem

Clara Novoa, Apan Qasem

AI总结:

针对NP难的二次分配问题,提出2opt与禁忌搜索算法的GPU加速并行实现,通过多层并行与代码优化充分利用硬件,在QAPLIB数据集上速度最高提升63倍,解的质量接近已知最优值。

摘要:

二次分配问题(QAP)是一类重要的组合优化问题,在物流、制造等诸多领域均有应用。QAP属于NP难问题,计算难度极高,针对大多数真实数据集,都需要借助复杂的启发式算法才能得到可接受的解。\n本文提出了用于求解QAP的2opt算法与禁忌搜索算法的GPU加速实现方案。针对这两种算法,我们挖掘了多层级的并行性,并采用了新颖的代码优化技术,可充分利用GPU硬件资源。在知名的QAPLIB数据集上开展的一系列实验表明,我们的方案平均运行速度比现有实现快一个数量级,在特定算例上最高可实现63倍的加速比。我们实现的2opt算法与禁忌搜索算法得到的解的质量,分别与已知最优值相差在1.03%和0.15%以内。实验结果也为加速型QAP求解器的性能特征提供了关键洞见,尤其表明算法选择与输入数据集的形态都是实现高效求解方案的关键因素。

英文摘要:

The Quadratic Assignment Problem (QAP) is an important combinatorial optimization problem with applications in many areas including logistics and manufacturing. QAP is known to be NP-hard, a computationally challenging problem, which requires the use of sophisticated heuristics in finding acceptable solutions for most real-world data sets. In this paper, we present GPU-accelerated implementations of a 2opt and a tabu search algorithm for solving the QAP. For both algorithms, we extract parallelism at multiple levels and implement novel code optimization techniques that fully utilize the GPU hardware. On a series of experiments on the well-known QAPLIB data sets, our solutions, on average run an order-of-magnitude faster than previous implementations and deliver up to a factor of 63 speedup on specific instances. The quality of the solutions produced by our implementations of 2opt and tabu is within 1.03% and 0.15% of the best known values. The experimental results also provide key insight into the performance characteristics of accelerated QAP solvers. In particular, the results reveal that both algorithmic choice and the shape of the input data sets are key factors in finding efficient implementations.

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

↑