Data Exchange Topologies for the DISCO-HITS Algorithm to Solve the QAP
Exchanging information between processes in a distributed environment can be a powerful mechanism to improve results for combinatorial problem. In this study, we propose three exchange topologies for the distance cooperation hybrid iterative tabu search algorithm called DISCO-HITS. These topologies are experimented on the quadratic assignment problem. A comparison between the three topologies is performed using 21 well known instances of size between 40 and 150. Our algorithm produces competitive results and can outperform algorithms from the literature for many benchmark instances.
KeywordsMetaheuristics DISCO-HITS Quadratic assignment problem Topologies
- 2.Talbi, E.G.: Metaheuristics: From Design to Implementation. University of Lille - CNRS - INRIA, John wiley and sons Inc. (2009)Google Scholar
- 4.James, T., Rego, C., Glover, F.: Multistart tabu search and diversification strategies for the quadratic assignment problem. IEEE Trans. Syst. Man Cybern. Part A Syst. Hum. 39 (3), 579–596 (2009)Google Scholar
- 13.Burkard, R.E., Karisch, S.E., Rendl, F.: QAPLIB - a quadratic assignment problem library. J. Glob. Optim. 10(4), 391–403 (1997)Google Scholar