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

二次分配问题模拟退火启发式算法的一种有效实现

An efficient implementation of the simulated annealing heuristic for the quadratic assignment problem

Gerald Paul

摘要:

二次分配问题是组合优化中最困难的问题之一。模拟退火(SA)是获得QAP最优解近似值的最强大和最常用的算法之一。我们提出了一个有效的实现SA启发式执行速度超过100倍,然后现有的实现大的问题大小和大量的SA迭代。

英文摘要:

The quadratic assignment problem (QAP) is one of the most difficult combinatorial optimization problems. One of the most powerful and commonly used heuristics to obtain approximations to the optimal solution of the QAP is simulated annealing (SA). We present an efficient implementation of the SA heuristic which performs more than 100 times faster then existing implementations for large problem sizes and a large number of SA iterations.

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

↑