Improved Hybrid Iterative Tabu Search for QAP Using Distance Cooperation
The quadratic assignment problem can be considered as one of the hardest and most studied combinatorial problems. In this paper, we propose and analyze three distributed algorithms based on hybrid iterative tabu search. These algorithms follow the design of the parallel algorithmic level. A new mechanism to exchange information between processes is introduced. Through 34 well-known instances from QAPLIB benchmark, our algorithms produce competitive results. This experimentation shows that our best propositions can exceed or equal several leading algorithms from the literature in almost all the hardest benchmark instances.
KeywordsMetaheuristics Iterative tabu search Quadratic assignment problem Cooperative and distributed algorithms
- 14.Misevicius, A., Kilda, B.: Iterated tabu search: an improvement to standard tabu search. Inf. Technol. Control 35(3), 187–197 (2006)Google Scholar