The Fifth Metaheuristics International Conference ? ?-1 GRASP with path-relinking for the QAP
The Fifth Metaheuristics International Conference ? ?-1 GRASP with path-relinking for the QAP
复制标题
DOI：
--
复制
发表时间：
--
期刊：
影响因子：
--
通讯作者：
Carlos A. S. Oliveira;P. Pardalos;M. G. Resende
中科院分区：
文献类型：
--
作者：
Carlos A. S. Oliveira;P. Pardalos;M. G. Resende
The quadratic assignment problem (QAP) was first proposed by Koopmans and Beckman [5] in the context of the plant location problem. Given n facilities, represented by the set F f1 fn , and n locations represented by the set L l1 ln , one must determine to which location each facility must be assigned. Let An n ai j be a matrix where ai j represents the flow between facilities fi and f j. Let Bn n bi j be a matrix where entry bi j represents the distance between locations li and l j . Let p : 1 n 1 n be an assignment and define the cost of this assignment to be
