A quadratic assignment problem assigns facilities to locations while minimizing interaction flow weighted by assigned-location distances.
A quadratic assignment problem assigns facilities to locations while minimizing interaction flow multiplied by the distances between assigned facilities. It is a special case of nonlinear optimization with a quadratic objective. section 2.1.4
Plant layout
A factory assigns departments to locations to reduce material-handling cost. For facilities i and j, cost equals interaction flow ωij multiplied by their assigned-location distance; the overall objective is represented as minimizing trace(WXDXᵀ). section 2.1.4
How Optimization Algorithms: AI techniques for design, planning, and control problems covers it
How deep it goes
Defines flow-distance costs and gives a matrix formulation, but does not develop a solution algorithm.
Examples
Uses a plant-layout figure, facility interaction flows, distance matrices, and a trace-based objective.
What it assumes
Distinguishes linear from nonlinear objectives and constraints and recognizes integer, binary, and continuous variables.
What you can do after
Evaluate candidate facility layouts by calculating flow-distance costs and expressing the objective in matrix form.
How it connects
Connects quadratic programming with nonlinear optimization, facility location, plant layout, and material-handling cost.
problemkind of · A problem is a difficulty, obstacle, or undesirable condition requiring investigation, mitigation, or resolution.
quadratic programkind of · A quadratic program is an optimization problem with a quadratic objective function and linear constraints on its variables.
This explainer was generated by Manning's knowledge graph from the text of Optimization Algorithms: AI techniques for design, planning, and control problems. The section links point to the parts of the book it draws on.
