The Quadratic Assignment Problem
The Quadratic Assignment Problem
复制标题
DOI：
10.1007/978-3-319-13111-5_13
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
Z. Drezner
中科院分区：
文献类型：
--
作者：
Z. Drezner
本章回顾了二次分配问题。给出了设施对之间的权重以及相同数量的位置之间的距离。问题是找到将设施分配到能够最小化距离加权和的位置。该问题被认为是最困难的组合优化问题之一。构建高效的解决方案算法（精确的或启发式的）具有挑战性，并且已被运筹学/管理科学、工业工程或计算机科学领域的社区广泛研究。给出了应用示例，简要描述了相关布局问题，回顾了精确和启发式解决算法，并报告了测试问题实例和结果的列表。
The quadratic assignment problem is reviewed in this chapter. Weights between pairs of facilities and distances between the same number of locations are given. The problem is to find the assignment of facilities to locations that minimizes the weighted sum of distances. This problem is considered to be one of the most difficult combinatorial optimization problems. The construction of efficient solution algorithms (exact or heuristic) is challenging and has been extensively investigated by the communities working in Operations Research/Management Science, Industrial Engineering, or Computer Science. Examples of applications are given, the related layout problem is briefly described, exact and heuristic solution algorithms are reviewed, and a list of test problem instances and results are reported.