Skip to main content
SpringerLink
Log in

Improved Hybrid Iterative Tabu Search for QAP Using Distance Cooperation

  • Conference paper
  • First Online:
Artificial Evolution (EA 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10764))

  • 609 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Benlic, U., Hao, J.K.: Breakout local search for the quadratic assignement problem. Appl. Math. Comput. 219(9), 4800–4815 (2013)

    MathSciNet  MATH  Google Scholar 

  2. Benlic, U., Hao, J.K.: Memetic search for the quadratic assignment problem. Expert Syst. Appl. 42, 584–595 (2015)

    Article  Google Scholar 

  3. Burkard, R.E., Karisch, S.E., Rendl, F.: QAPLIB - a quadratic assignment problem library. J. Glob. Optim. 10(4), 391–403 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  4. Drezner, Z.: Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem. Comput. Oper. Res. 35(3), 717–736 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  5. Drezner, Z., Hahn, P.M., Taillard, E.: Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods. Ann. Oper. Res. 139(1), 65–94 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  6. Duman, E., Or, I.: The quadratic assignement problem in the context of the printed circuit board assembly process. Comput. Oper. Res. 34(1), 163–179 (2007)

    Article  MATH  Google Scholar 

  7. Glover, F.: A template for scatter search and path relinking. In: Hao, J.-K., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds.) AE 1997. LNCS, vol. 1363, pp. 1–51. Springer, Heidelberg (1998). https://doi.org/10.1007/BFb0026589

    Chapter  Google Scholar 

  8. James, T., Rego, C., Glover, F.: A cooperative parallel tabu search algorithm for the quadratic assignment problem. Eur. J. Oper. Res. 195(3), 810–826 (2009)

    Article  MATH  Google Scholar 

  9. 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)

    Article  Google Scholar 

  10. Koopmans, T., Beckmann, M.: Assignment problems and the location of economic activities. Econometrica 25(1), 53–76 (1957)

    Article  MathSciNet  MATH  Google Scholar 

  11. Loiola, E.M., de Abreu, N.M.M., Netto, P.O.B., Hahn, P., Querido, T.: A survey for the quadratic assignment problem. Eur. J. Oper. Res. 176(2), 657–690 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  12. Merz, P., Freisleben, B.: Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans. Evol. Comput. 4(4), 337–352 (2000)

    Article  Google Scholar 

  13. Misevicius, A.: An improved hybrid genetic algorithm: new results for the quadratic assignment problem. Knowl. Based Syst. 17(2–4), 65–73 (2004)

    Article  Google Scholar 

  14. Misevicius, A., Kilda, B.: Iterated tabu search: an improvement to standard tabu search. Inf. Technol. Control 35(3), 187–197 (2006)

    Google Scholar 

  15. Stützle, T.: Iterated local search for the quadratic assignment problem. Eur. J. Oper. Res. 174(3), 1519–1539 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  16. Taillard, E.: Robust taboo search for the quadratic assignement problem. Parallel Comput. 17(4–5), 443–455 (1991)

    Article  MathSciNet  Google Scholar 

  17. Talbi, E.G.: Metaheuristics: from Design to Implementation. Wiley, University of Lille - CNRS - INRIA, Hoboken (2009)

    Book  MATH  Google Scholar 

  18. Ulutas, B.H., Konak, S.K.: An artificial immune system based algorithm to solve unequal area facility layout problem. Expert Syst. Appl. 39(5), 5384–5395 (2012)

    Article  Google Scholar 

  19. Wu, Q., Hao, J.K.: Solving the winner determination problem via a weighted maximum clique heuristic. Expert Syst. Appl. 42(1), 355–365 (2015)

    Article  Google Scholar 

  20. Zhang, Q., Sun, J., Tsang, E.: An evolutionary algorithm with guided mutation for the maximum clique problem. IEEE Trans. Evol. Comput. 9(2), 192–200 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université Lille 1, CRIStAL/UMR CNRS 9189 - INRIA Lille Nord Europe, 59655, Villeneuve d’Ascq cedex, France

    Omar Abdelkafi

  2. Université de Haute-Alsace, LMIA, EA 3993, 68093, Mulhouse, France

    Lhassane Idoumghar & Julien Lepagnot

Authors
  1. Omar Abdelkafi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lhassane Idoumghar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Julien Lepagnot
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Omar Abdelkafi .

Editor information

Editors and Affiliations

  1. Inria, Thiverval-Grignon, France

    Evelyne Lutton

  2. Inria Bordeaux, University of Bordeaux, Talence, France

    Pierrick Legrand

  3. ECAM Strasbourg-Europe, Schiltigheim, France

    Pierre Parrend

  4. University of Tours, Tours, France

    Nicolas Monmarché

  5. Université Paris-Sud, Orsay, France

    Marc Schoenauer

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Abdelkafi, O., Idoumghar, L., Lepagnot, J. (2018). Improved Hybrid Iterative Tabu Search for QAP Using Distance Cooperation. In: Lutton, E., Legrand, P., Parrend, P., Monmarché, N., Schoenauer, M. (eds) Artificial Evolution. EA 2017. Lecture Notes in Computer Science(), vol 10764. Springer, Cham. https://doi.org/10.1007/978-3-319-78133-4_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-78133-4_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-78132-7

  • Online ISBN: 978-3-319-78133-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation