The quadratic assignment problem: an analysis of applications and solution strategies

A wide variety of practical problems in design, planning, and management can be formulated as quadratic assignment problems, and this paper discusses this class of problem. Since algorithms for producing optimal solutions to such problems are computationally infeasible for all but small problems of this type, heuristic techniques must usually be employed for the solution of real practical problems. This paper explores and compares a variety of solution techniques found in the literature, considering the trade-offs between computational efficiency and quality of solutions generated. Recommendations are made about the key factors to be considered in developing and applying heuristic solution procedures.