A new genetic algorithm for the quadratic assignment problem

A new genetic algorithm for the quadratic assignment problem

0.00 Avg rating0 Votes
Article ID: iaor2007353
Country: United States
Volume: 15
Issue: 3
Start Page Number: 320
End Page Number: 330
Publication Date: Jun 2003
Journal: INFORMS Journal On Computing
Authors:
Keywords: heuristics: tabu search
Abstract:

In this paper we propose several variants of a new genetic algorithm for the solution of the quadratic assignment problem. We designed a special merging rule for creating an offspring that exploits the special structure of the problem. We also designed a new type of a tabu search, which we term a concentric tabu search. This tabu search is applied on the offspring before consideration for inclusion in the population. The algorithm provided excellent results for a set of 29 test problems having between 30 and 100 facilities.

Reviews

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