Quadratic assignment problem

Combinatorial optimization problem

The quadratic assignment problem (QAP) is one of the fundamental combinatorial optimization problems in the branch of optimization or operations research in mathematics, from the category of the facilities location problems first introduced by Koopmans and Beckmann.[1]

The problem models the following real-life problem:

There are a set of n facilities and a set of n locations. For each pair of locations, a distance is specified and for each pair of facilities a weight or flow is specified (e.g., the amount of supplies transported between the two facilities). The problem is to assign all facilities to different locations with the goal of minimizing the sum of the distances multiplied by the corresponding flows.

Intuitively, the cost function encourages facilities with high flows between each other to be placed close together.

The problem statement resembles that of the assignment problem, except that the cost function is expressed in terms of quadratic inequalities, hence the name.

## Formal mathematical definition

[edit]

This section does not cite any sources. Please help improve this section by adding citations to reliable sources. Unsourced material may be challenged and removed. (April 2024) (Learn how and when to remove this message)

|

The formal definition of the quadratic assignment problem is as follows:

Given two sets, P ("facilities") and L ("locations"), of equal size, together with a weight function w : P × P → R and a distance function d : L × L → R. Find the bijection f : P → L ("assignment") such that the cost function:

∑ a , b ∈ P w ( a , b ) ⋅ d ( f ( a ) , f ( b ) ) {\displaystyle \sum _{a,b\in P}w(a,b)\cdot d(f(a),f(b))}
is minimized.

Usually weight and distance functions are viewed as square real-valued matrices, so that the cost function is written down as:

∑ a , b ∈ P w a , b d f ( a ) , f ( b ) {\displaystyle \sum _{a,b\in P}w_{a,b}d_{f(a),f(b)}}

In matrix notation:

min X ∈ Π n trace ⁡ ( W X D T X T ) {\displaystyle \min _{X\in \Pi _{n}}\operatorname {trace} (WXD^{T}X^{T})}

where  Π n {\displaystyle \Pi _{n}} is the set of  n × n {\displaystyle n\times n} permutation matrices,  W {\displaystyle W} is the weight matrix and  D {\displaystyle D} is the distance matrix.

## Computational complexity

[edit]

The problem is NP-hard, so there is no known algorithm for solving this problem in polynomial time, and even small instances may require long computation time. It was also proven that the problem does not have an approximation algorithm running in polynomial time for any (constant) factor, unless P = NP.[2] The travelling salesman problem (TSP) may be seen as a special case of QAP if one assumes that the flows connect all facilities only along a single ring, all flows have the same non-zero (constant) value and all distances are equal to the respective distances of the TSP instance. Many other problems of standard combinatorial optimization problems may be written in this form.

## Applications

[edit]

In addition to the original plant location formulation, QAP is a mathematical model for the problem of placement of interconnected electronic components onto a printed circuit board or on a microchip, which is part of the place and route stage of computer aided design in the electronics industry.

The QAP has also been used to model the cost of character placement on a keyboard. In this case, the locations are keys on the keyboard and their pairwise distances correspond to the time required to press a given pair of keys. The facilities are characters and their weights are proportional to how often the given pair of characters occur in a text corpus. This type of QAP model was used in the design of the French keyboard standard (NF Z71-300).[3]

## See also

[edit]

* Quadratic bottleneck assignment problem

## References

[edit]

1. ^ Koopmans TC, Beckmann M (1957). Assignment problems and the location of economic activities. Econometrica 25(1):53-76
2. ^ Sahni, Sartaj; Gonzalez, Teofilo (July 1976). "P-Complete Approximation Problems". Journal of the ACM. 23 (3): 555–565\. doi:10.1145/321958.321975. hdl:10338.dmlcz/103883.
3. ^ John, Maximilian; Karrenbauer, Andreas (2019). "Dynamic Sparsification for Quadratic Assignment Problems". Mathematical Optimization Theory and Operations Research (PDF). Vol. 11548\. Cham: Springer International Publishing. p. 232–246. doi:10.1007/978-3-030-22629-9_17. ISBN 978-3-030-22628-2.

## Other sources

[edit]

* Michael R. Garey and David S. Johnson (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman. ISBN 0-7167-1045-5. A2.5: ND43, pg.218.

## External links

[edit]

* https://doi.org/10.7488/ds/3428 QAPLIB - A Quadratic Assignment Problem Library
* http://www.wiomax.com/team/xie/maos-qap-quadratic-assignment-problem-project-portal/ MAOS-QAP - Java-based Quadratic Assignment Problem Solver
* https://CRAN.R-project.org/package=qap \- R package qap: Heuristics for the Quadratic Assignment Problem
* https://apps.microsoft.com/store/detail/qapsolver/9N7WMCFB6NZZ \- Metaheuristic QAP solver for Windows 10/11