Quadratic assignment problem: Difference between revisions

VisualWikitext

Revision as of 13:49, 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.

Example

Eric Miller to provide.

Applications

Natasha Rice and David Wittmann to provide.

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))})^{k}$

where

$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})$

or

$k$ represents

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.

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

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

@@ Line 15: / Line 15: @@
 === 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. 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.
+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
@@ Line 33: / Line 33: @@
 <math>C_{ij}</math> represents the number of wires connecting components <math>E_{i}</math> and <math>E_{i}</math>
-<math>(d_{s(i)s(j))})</math> is the length of wire needed to connect tow components if one is placed at <math>P_{\alpha}</math> and the other is placed at <math>P_{\beta}</math>
+<math>d_{s(i)s(j))}</math> is the length of wire needed to connect tow components if one is placed at <math>P_{\alpha}</math> and the other is placed at <math>P_{\beta}</math>. If <math>P_{\alpha}</math> has coordinates <math>(x_{\alpha}, y_{\alpha}, z_{\alpha})</math> then <math>d_{s(i)s(j))}</math> can be calculated by
+<math>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}) </math>
+or
+<math>k</math> represents
+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.
+When defining the problem Steinberg states that we have a set of n elements
 === Hospital Layout ===