- Quadratic assignment problem
The quadratic assignment problem (QAP) is one of fundamental
combinatorial optimizationproblems in the branch of optimization or operations researchin mathematics, from the category of the facilities locationproblems.
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.
The problem statement resembles that of the
assignment problem, only the cost functionis expressed in terms of quadratic inequalities, hence the name.
Formal mathematical definition
The formal definition of the quadratic assignment problem is
: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:
Usually weight and distance functions are viewed as square real-valued matrices, so that the cost function is written down as:
The problem is
NP-hard, so there is no known algorithmfor solving this problem in polynomial time, and even small instances may require long computation time. The Travelling salesman problemmay 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. Many other problems of standard combinatorial optimizationproblems may be written in this form.
A considerable amount of research in
ant colony optimization, a biologically-inspired heuristic, has centered on solving the QAP by achieving as good an approximation as possible.
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 boardor on a microchip, which is part of the place and routestage of the computer aided designin electronics industry.
* A2.5: ND43, pg.218.
Wikimedia Foundation. 2010.