Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem

Authors:
Ravindra K. Ahuja;Krishna C. Jha;James B. Orlin;Dushyant Sharma
Affiliations:
Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida 32611;Innovative Scheduling, Inc., Gainesville Technology Enterprise Center, Gainesville, Florida 32641;Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139;Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109
Venue:
INFORMS Journal on Computing
Year:
2007

Citing 0
Cited 5

Very Large-Scale Neighborhood Search for the K-Constraint Multiple Knapsack Problem

Journal of Heuristics
Multistart tabu search and diversification strategies for the quadratic assignment problem

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Probability Collectives: A multi-agent approach for solving combinatorial optimization problems

Applied Soft Computing
An implementation of the iterated tabu search algorithm for the quadratic assignment problem

OR Spectrum
A Tabu Search Approach for the NMR Protein Structure-Based Assignment Problem

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The quadratic assignment problem (QAP) consists of assigning n facilities to n locations to minimize the total weighted cost of interactions between facilities. The QAP arises in many diverse settings, is known to be NP-hard, and can be solved to optimality only for fairly small instances (typically, n ≤ 30). Neighborhood search algorithms are the most popular heuristic algorithms for solving larger instances of the QAP. The most extensively applied neighborhood structure for the QAP is the 2-exchange neighborhood. This neighborhood is obtained by swapping the locations of two facilities; its size is therefore O(n2). Previous efforts to explore larger neighborhoods (such as 3-exchange or 4-exchange neighborhoods) were not very successful, as it took too long to evaluate the larger set of neighbors. In this paper, we propose very large-scale neighborhood (VLSN) search algorithms when the size of the neighborhood is very large, and we propose a novel search procedure to enumerate good neighbors heuristically. Our search procedure relies on the concept of an improvement graph that allows us to evaluate neighbors much faster than existing methods. In this paper, we present extensive computational results of our algorithms when applied to standard benchmark instances.