The quadratic assignment problem consists of placing factories (facilities) in locations in such a way that the total cost, expressed as the sum of the products of the distances between facilities and the flows of goods between them, is minimized. This article presents a new way of modeling the problem using bipartite graphs and a new step-by-step method for solving the problem, which involves finding a maximum matching with minimum weight, taking into account the physical placement of factories (facilities) in locations.(…)
The article contains 11918 characters.
Source: Czasopismo Logistyka
An alternative method for solving the quadratic assignment problem – PDF file for download