Comparison of iterative searches for the quadratic assignment problem

Comparison of iterative searches for the quadratic assignment problem

0.00 Avg rating0 Votes
Article ID: iaor19961051
Country: United Kingdom
Volume: 3
Issue: 2
Start Page Number: 87
End Page Number: 105
Publication Date: Aug 1995
Journal: Location Science
Authors:
Keywords: location
Abstract:

This paper compares some of the most efficient heuristic methods for the quadratic assignment problem. These methods are known as strict taboo search, robust taboo search, reactive taboo search and genetic hybrids. It is shown that the efficiency of these methods strongly depends on the problem type and that no one method is better than all the others. A fast method for tuning the short term memory parameters of taboo searchers is proposed and its validity is experimentally verified on long searchers. A new type of quadratic assignment problem occurring in the design of grey patterns is proposed and it is shown how to adapt and improve the existing iterative searches for this specific problem. Finally, the usual way of implementing approximations of strict taboo search is discussed and better approximations are proposed.

Reviews

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