Advertisement

Data Exchange Topologies for the DISCO-HITS Algorithm to Solve the QAP

  • Omar AbdelkafiEmail author
  • Lhassane Idoumghar
  • Julien Lepagnot
  • Mathieu Brévilliers
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10103)

Abstract

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.

Keywords

Metaheuristics DISCO-HITS Quadratic assignment problem Topologies 

References

  1. 1.
    Koopmans, T., Beckmann, M.: Assignment problems and the location of economic activities. Econometrica 25(1), 53–76 (1957)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Talbi, E.G.: Metaheuristics: From Design to Implementation. University of Lille - CNRS - INRIA, John wiley and sons Inc. (2009)Google Scholar
  3. 3.
    Taillard, E.: Robust taboo search for the quadratic assignement problem. Parallel Comput. 17, 443–455 (1991)MathSciNetCrossRefGoogle Scholar
  4. 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
  5. 5.
    Benlic, U., Hao, J.K.: Breakout local search for the quadratic assignement problem. Appl. Math. Comput. 219, 4800–4815 (2013)MathSciNetzbMATHGoogle Scholar
  6. 6.
    James, T., Rego, C., Glover, F.: A cooperative parallel tabu search algorithm for the quadratic assignment problem. Eur. J. Oper. Res. 195, 810–826 (2009)CrossRefzbMATHGoogle Scholar
  7. 7.
    Czapinski, M.: An effective parallel multistart tabu search for quadratic assignment problem on CUDA platform. J. Parallel Distrib. Comput. 73, 1461–1468 (2013)CrossRefGoogle Scholar
  8. 8.
    Talbi, E.G., Roux, O., Fonlupt, C., Robillard, D.: Parallel ant colonies for the quadratic assignment problem. Future Gener. Comput. Syst. 17, 441–449 (2001)CrossRefzbMATHGoogle Scholar
  9. 9.
    James, T., Rego, C., Glover, F.: Sequential and parallel path relinking algorithms for the quadratic assignment problem. IEEE Intell. Syst. 20(4), 58–65 (2005)CrossRefGoogle Scholar
  10. 10.
    Tosun, U.: On the performance of parallel hybrid algorithms for the solution of the quadratic assignment problem. Eng. Appl. Artif. Intell. 39, 267–278 (2015)CrossRefGoogle Scholar
  11. 11.
    Abdelkafi, O., Idoumghar, L., Lepagnot, J.: Comparison of two diversification methods to solve the quadratic assignment problem. Procedia Comput. Sci. 51, 2703–2707 (2015)CrossRefGoogle Scholar
  12. 12.
    Dokeroglu, T.: Hybrid teaching-learning-based optimization algorithms for the quadratic assignment problem. Comput. Ind. Eng. 85, 86–101 (2015)CrossRefGoogle Scholar
  13. 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

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Omar Abdelkafi
    • 1
    Email author
  • Lhassane Idoumghar
    • 1
  • Julien Lepagnot
    • 1
  • Mathieu Brévilliers
    • 1
  1. 1.Université de Haute-Alsace (UHA), LMIA (E.A. 3993)MulhouseFrance

Personalised recommendations