Quadratic assignment problem: Difference between revisions

Revision as of 17:47, 21 November 2020

Author: Thomas Kueny, Eric Miller, Natasha Rice, Joseph Szczerba, David Wittmann (SysEn 5800 Fall 2020)

Introduction

Theory, Methodology, and/or Algorithmic Discussions

Joe Szczerba and Tom Kueny to provide.

Numerical Example

Consider the QAP of placing 3 facilities in 3 locations. Let the distance and flow matrices be defined respectively as $D={\begin{bmatrix}0&5&6\\5&0&3.6\\6&3.6&0\end{bmatrix}}$ , ${\textstyle F={\begin{bmatrix}0&10&3\\10&0&6.5\\3&6.5&0\end{bmatrix}}}$ .

For each pair $(i,j)$ , $D_{i,j}$ represents the distance between locations $i$ and $j$ . $F_{i,j}$ represents the required flow (of supplies, products, etc.) between facilities $i$ and $j$ . The optimal solution will be the arrangement of the 3 facilities in the 3 locations so that the total flow over distance is minimized. Intuitively, the product of distance and flow represents cost, and the objective is to minimize this cost. Ideally, two facilities with lots of flow (more product or supplies) between the two should be placed closer together than two facilities that rarely interact (low flow).

There are $3!=6$ permutations of the 3 facilities in the 3 locations. The set of these permutations is typically denoted $S_{3}$ . As an example, the permutation $\phi =(321)$ represents facility 3 being placed at location 1, facility 1 at location 2 and facility 2 at location 3. Each permutation can be assigned a permutation matrix. The permutation matrix of $\phi$ can be written as $X_{\phi }={\begin{bmatrix}0&0&1\\1&0&0\\0&1&0\end{bmatrix}}$ . The operation $X_{\phi }DX_{\phi }^{T}$ permutes the distance matrix values so that $D_{i,j}$ represents the distance between facilities $i$ and $j$ if the facilities are arranged according to the permutation $\phi$ . Let $P$ be the set of permutation matrices for $S_{3}$ .

The problem can be stated as follows:

$\min _{X\in P}<F,XDX^{T}>$

Applications

Natasha Rice and David Wittmann to provide.

Inter-plant Transportation Problem

David (Work-in-progress) The quadratic assignment problem was first introduced by Koopmans and Beckmann to address how economic decisions could be made to optimize the transportation costs of goods between both manufacturing plants and locations.

The Backboard Wiring Problem

As the quadratic assignment problem is focused on minimizing the cost of traveling from one location to another, it is an ideal approach determining placement of components in many modern electronics. Leon Steinberg proposed a QAP solution optimize the layout of elements on a blackboard by minimizing the total amount of wiring required.

When defining the problem Steinberg states that we have a set of n elements

$E=\left\{E_{1},E_{2},...,E_{n}\right\}$

as well as a set of r points

$P_{1},P_{2},...,P_{r}$ where $r\geq n$

In his paper he derives the below formula:

$min\sum _{1\leq i\leq j\leq n}^{}C_{ij}(d_{s(i)s(j))})$

$C_{ij}$ represents the number of wires connecting components $E_{i}$ and $E_{i}$

$d_{s(i)s(j))}$ is the length of wire needed to connect tow components if one is placed at $P_{\alpha }$ and the other is placed at $P_{\beta }$ . If $P_{\alpha }$ has coordinates $(x_{\alpha },y_{\alpha },z_{\alpha })$ then $d_{s(i)s(j))}$ can be calculated by

$d_{s(i)s(j))}=\surd ({\bigl (}x_{\alpha }-x_{\beta }{\bigr )}^{2}+{\bigl (}y_{\alpha }-y_{\beta }{\bigr )}^{2}+{\bigl (}z_{\alpha }-z_{\beta }{\bigr )}^{2})$

$s(x)$ represents a particular placement of a component.

In his paper Steinberg a backboard with a 9 by 4 array, allowing for 36 potential positions for the 34 components that needed to be placed on the backboard. For the calculation he selected a random initial placement of s1 and chose a random family of 25 unconnected sets.

The initial placement of components is shown below:

After the initial placement of elements it took an additional 35 iterations to get us to our final optimized backboard layout. Leading to a total of 59 iterations and a final wire length of 4,969.440.

Hospital Layout

Campus Building Arrangement

Molecular Confrontation Problem

Conclusion

References

Alwalid N. Elshafei. Hospital Layout as a Quadratic Assignment Problem. Operational Research Quarterly (1970-1977). 1977;28(1):167. doi:10.2307/3008789
Dickey JW, Hopkins JW. Campus building arrangement using topaz. Transportation Research. 6(1):59-68. doi:10.1016/0041-1647(72)90111-6
Leon Steinberg. The Backboard Wiring Problem: A Placement Algorithm. SIAM Review. 1961;3(1):37.
Phillips AT, Rosen JB. A quadratic assignment formulation of the molecular conformation problem. Journal of Global Optimization: An International Journal Dealing with Theoretical and Computational Aspects of Seeking Global Optima and Their Applications in Science, Management, and Engineer. 1994;4(2):229. doi:10.1007/bf01096724
https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.217.1914&rep=rep1&type=pdf
Koopmans, T., & Beckmann, M. (1957). Assignment Problems and the Location of Economic Activities. Econometrica, 25(1), 53-76. doi:10.2307/1907742

@@ Line 15: / Line 15: @@
 For each pair <math>(i,j)</math>,  <math>D_{i,j}</math> represents the distance between locations <math>i</math> and <math>j</math>. <math>F_{i,j}</math> represents the required flow (of supplies, products, etc.) between facilities <math>i</math> and <math>j</math>. The optimal solution will be the arrangement of the 3 facilities in the 3 locations so that the total flow over distance is minimized. Intuitively, the product of distance and flow represents cost, and the objective  is to minimize this cost. Ideally, two facilities with lots of flow (more product or supplies) between the two should be placed closer together than two facilities that rarely interact (low flow).
-There are <math>3! = 6</math> permutations of the 3 facilities in the 3 locations. The set of these permutations is typically denoted <math>S_3 </math>.  As an example, the permutation <math>\phi=(3 2 1)</math> represents facility 3 being placed at location 1, facility 1 at location 2 and facility 2 at location 3. Each permutation can be assigned a permutation matrix. The permutation matrix of <math>\phi </math>can be written as <math>X_{\phi} = \begin{bmatrix} 0 & 0 & 1 \\ 1 & 0 &0 \\ 0 &1 & 0 \end{bmatrix}</math>. The operation <math>X_{\phi}DX_{\phi}^{T} </math> permutes the distance matrix values so that <math>D_{i,j}</math> represents the distance between facilities <math>i</math> and <math>j</math> if the facilities are arranged according to the permutation <math>\phi</math>.
+There are <math>3! = 6</math> permutations of the 3 facilities in the 3 locations. The set of these permutations is typically denoted <math>S_3 </math>.  As an example, the permutation <math>\phi=(3 2 1)</math> represents facility 3 being placed at location 1, facility 1 at location 2 and facility 2 at location 3. Each permutation can be assigned a permutation matrix. The permutation matrix of <math>\phi </math>can be written as <math>X_{\phi} = \begin{bmatrix} 0 & 0 & 1 \\ 1 & 0 &0 \\ 0 &1 & 0 \end{bmatrix}</math>. The operation <math>X_{\phi}DX_{\phi}^{T} </math> permutes the distance matrix values so that <math>D_{i,j}</math> represents the distance between facilities <math>i</math> and <math>j</math> if the facilities are arranged according to the permutation <math>\phi</math>. Let <math>P</math> be the set of permutation matrices for <math>S_3 </math>.
@@ Line 21: / Line 21: @@
 The problem can be stated as follows:
-<math>\min_{X \in P)}</math>
+<math>\min_{X \in P} <F,XDX^{T}></math>
 == Applications ==