Skip to main content
SpringerLink
Log in
Book cover

International Conference on Advanced Intelligent Systems for Sustainable Development

AI2SD 2018: Advanced Intelligent Systems for Sustainable Development (AI2SD’2018) pp 122–130Cite as

Elephants Herding Optimization for Solving the Travelling Salesman Problem

  • Conference paper
  • First Online:

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

Abstract

This paper proposes a novel metaheuristic called Elephant Herding Optimization (EHO) to solve the Travelling Salesman Problem (TSP), which is a combinatorial optimization problem classified as NP-Hard. The EHO algorithm is bio-inspired from the natural herding behavior of elephants groups, which proved its efficiency to solve continued optimization problems. To extend the application of this algorithm, we had proposed a novel adaptation of the EHO by respecting the natural herding behavior of elephants. To test the efficiency of our proposal adaptation, we applied the adapted EHO algorithm on some benchmark instances of TSPLIB. The obtained results shows the excellent performance of the proposed method.

This is a preview of subscription content, 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

Learn about institutional subscriptions

References

  1. Flood, M.M.: The travelling-salesman problem. Oper. Res. 4(1), 61–75 (1956)

    Article  MathSciNet  Google Scholar 

  2. Hochbaum, D.S.: Approximation Algorithms for NP-Hard Problems. PWS Publishing Co., Boston (1996)

    MATH  Google Scholar 

  3. Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. J. Algorithms 37(1), 146–188 (2000)

    Article  MathSciNet  Google Scholar 

  4. Aarts, E., Korst, J., Michiels, W.: Simulated annealing. In: Search Methodologies, p. 187–210. Springer, Boston (2005)

    Google Scholar 

  5. Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem. Manag. Sci. 40(10), 1276–1290 (1994)

    Article  Google Scholar 

  6. Fonseca, C.M., Fleming, Peter, J., et al.: Genetic Algorithms for Multiobjective Optimization: Formulation, Discussion and Generalization. In: ICGA, pp. 416–423 (1993)

    Google Scholar 

  7. Dorigo, M., Birattari, M.: Ant colony optimization. In: Encyclopedia of Machine Learning, pp. 36–39. Springer, Boston (2011)

    Google Scholar 

  8. Poli, R., Kennedy, J., Blackwell, T.: Particle swarm optimization. Swarm Intell. 1(1), 33–57 (2007)

    Article  Google Scholar 

  9. Wong, L.-P., Low, M.Y.H., Chong, C.S.: A bee colony optimization algorithm for travelling salesman problem. In: Second Asia International Conference on Modeling & Simulation, AICMS 2008, pp. 818–823. IEEE (2008)

    Google Scholar 

  10. Bouzidi, M., Riffi, M.E.: Discrete novel hybrid particle swarm optimization to solve travelling salesman problem. In: 5th Workshop on Codes, Cryptography and Communication Systems (WCCCS), pp. 17–20. IEEE (2014)

    Google Scholar 

  11. Bouzidi, A., Riffi, M.E.: Discrete cat swarm optimization to resolve the travelling salesman problem. Int. J. Adv. Res. Comput. Sci. Softw. Eng. 3(9), 13–18 (2013)

    Google Scholar 

  12. Mzili, I., Riffi, M.E.: Discrete penguins search optimization algorithm to solve the travelling salesman problem. J. Theor. Appl. Inf. Technol. 72(3), 331–336 (2015)

    Google Scholar 

  13. Bouzidi, S., Riffi, M.E.: Discrete swallow swarm optimization algorithm for travelling salesman problem. In: Proceedings of the 2017 International Conference on Smart Digital Environment, pp. 80–84. ACM (2017)

    Google Scholar 

  14. Wang, G.-G., Deb, S., Gao, X.-Z., et al.: A new metaheuristic optimisation algorithm motivated by elephant herding behaviour. Int. J. Bio-Inspired Comput. 8(6), 394–409 (2016)

    Article  Google Scholar 

  15. Reinelt, G.: TSPLIB—a travelling salesman problem library. ORSA J. Comput. 3(4), 376–384 (1991)

    Article  Google Scholar 

  16. Mcgovern, S.M., Gupta, S.M.: 2-opt heuristic for the disassembly line balancing problem. In: Environmentally Conscious Manufacturing III, pp. 71–85. International Society for Optics and Photonics (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory LAROSERI, Department of Computer Science, Faculty of Science, Chouaib Doukkali University, EI Jadida, Morocco

    Anass Hossam, Abdelhamid Bouzidi & Mohammed Essaid Riffi

Authors
  1. Anass Hossam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Abdelhamid Bouzidi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mohammed Essaid Riffi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anass Hossam .

Editor information

Editors and Affiliations

  1. Computer Sciences Department, Faculty of Sciences and Techniques of Tangier, Abdelmalek Essaâdi University, Souani Tangier, Morocco

    Mostafa Ezziyyani

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hossam, A., Bouzidi, A., Riffi, M.E. (2019). Elephants Herding Optimization for Solving the Travelling Salesman Problem. In: Ezziyyani, M. (eds) Advanced Intelligent Systems for Sustainable Development (AI2SD’2018). AI2SD 2018. Advances in Intelligent Systems and Computing, vol 912. Springer, Cham. https://doi.org/10.1007/978-3-030-12065-8_12

Download citation

Publish with us

Policies and ethics

Search

Navigation