Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
INFORMS Journal on Computing · 1999 · Volume 11 · Issue 4
Abstract
This article introduces two new techniques for solving the Quadratic Assignment Problem. The first is a heuristic technique, defined in accordance with the Ant System metaphor, and includes as a distinctive feature the use of a new lower bound at each constructive step. The second is a branch-and-bound exact approach, containing some elements introduced in the Ant algorithm. Computational results prove the effectiveness of both approaches.
Keywords
Combinatorial optimization problem, Quadratic assignment problem, the ant system, branch and bound
Enable JavaScript for citation tools and additional paper interactions.