Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem

Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem

0.00 Avg rating0 Votes
Article ID: iaor20012517
Country: United States
Volume: 11
Issue: 4
Start Page Number: 358
End Page Number: 369
Publication Date: Sep 1999
Journal: INFORMS Journal On Computing
Authors:
Keywords: programming: branch and bound, heuristics, programming: quadratic
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.

Reviews

Required fields are marked *. Your email address will not be published.