Article ID: | iaor20091372 |
Country: | United Kingdom |
Volume: | 35 |
Issue: | 3 |
Start Page Number: | 717 |
End Page Number: | 736 |
Publication Date: | Mar 2008 |
Journal: | Computers and Operations Research |
Authors: | Drezner Zvi |
Keywords: | heuristics: genetic algorithms, heuristics: tabu search |
In this paper we perform extensive computational experiments solving quadratic assignment problems using various variants of a hybrid genetic algorithm. We introduce a new tabu search (simple tabu). We compared the modified robust tabu and the simple tabu as improvement algorithms in a hybrid genetic algorithm with other tabu searches (concentric tabu, ring moves, all moves, robust tabu) with superior results. We also tested several modifications of the hybrid genetic algorithm and all of them produced good results.