Skip to main content
SpringerLink
Log in

First Adaptation of Hunting Search Algorithm for the Quadratic Assignment Problem

  • Conference paper
  • First Online:
Europe and MENA Cooperation Advances in Information and Communication Technologies

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 520))

Abstract

Quadratic assignment problem is one of the basic combinatorial optimization problems NP-hard. This paper aims to present a new algorithm for solving the quadratic assignment problem: Hunting Search algorithm. It is a metaheuristic inspired by the method of group hunting of predatory animals. To show the performance of this algorithm, it has been checked on a set of seventeen instances of QAPLib and it gave good results.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Lawler, E.L.: The quadratic assignment problem. Manage. Sci. 9(4), 586–599 (1963)

    Article  MathSciNet  MATH  Google Scholar 

  2. Laporte, G., Mercure, H.: Balancing hydraulic turbine runners: A quadratic assignment problem. Eur. J. Oper. Res. 35(3), 378–381 (1988)

    Article  Google Scholar 

  3. Haghani, A., Chen, M.-C.: Optimizing gate assignments at airport terminals. Transp. Res. Part A: Policy Pract. 32(6), 437–454 (1998)

    Google Scholar 

  4. Szwed, P. et al.: OpenCL implementation of PSO algorithm for the quadratic assignment problem. In: International Conference on Artificial Intelligence and Soft Computing. pp. 223–234. Springer (2015)

    Google Scholar 

  5. Chmiel, W., Szwed, P.: Bees algorithm for the quadratic assignment problem on CUDA platform. In: Man–Machine Interactions 4. pp. 615–625. Springer (2016)

    Google Scholar 

  6. Ahmed, Z.H.: A multi-parent genetic algorithm for the quadratic assignment problem. OPSEARCH 52(4), 714–732 (2015)

    Article  MathSciNet  Google Scholar 

  7. Oftadeh, R., et al.: A novel meta-heuristic optimization algorithm inspired by group hunting of animals: hunting search. Comput. Math Appl. 60(7), 2087–2098 (2010)

    Article  MATH  Google Scholar 

  8. Agharghor, A., Riffi, M.E.: Hunting search algorithm to solve the traveling salesman problem. J. Theor. Appl. Inf. Technol. 74, 1 (2015)

    Google Scholar 

  9. Burkard, R.E., et al.: QAPLIB–a quadratic assignment problem library. J. Global Optim. 10(4), 391–403 (1997)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory of LAROSERIE, Department of Computer Science, Faculty of Sciences, Chouaïb Doukkali University, El Jadida, Morocco

    Amine Agharghor & Mohammed Essaid Riffi

Authors
  1. Amine Agharghor
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohammed Essaid Riffi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Amine Agharghor .

Editor information

Editors and Affiliations

  1. Fac de Ciências e Tech Dept de Enge Info, Universidade de Coimbra, Coimbra, Portugal

    Álvaro Rocha

  2. Présidence de l'Université Mohammed Prem, University Mohammed First Oujda, Oujda, Morocco

    Mohammed Serrhini

  3. (CIETI) & (ISEP), School of Engg Polytechnic of Porto, Porto, Portugal

    Carlos Felgueiras

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Agharghor, A., Riffi, M.E. (2017). First Adaptation of Hunting Search Algorithm for the Quadratic Assignment Problem. In: Rocha, Á., Serrhini, M., Felgueiras, C. (eds) Europe and MENA Cooperation Advances in Information and Communication Technologies. Advances in Intelligent Systems and Computing, vol 520. Springer, Cham. https://doi.org/10.1007/978-3-319-46568-5_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-46568-5_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-46567-8

  • Online ISBN: 978-3-319-46568-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation