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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Flood, M.M.: The travelling-salesman problem. Oper. Res. 4(1), 61–75 (1956)
Hochbaum, D.S.: Approximation Algorithms for NP-Hard Problems. PWS Publishing Co., Boston (1996)
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)
Aarts, E., Korst, J., Michiels, W.: Simulated annealing. In: Search Methodologies, p. 187–210. Springer, Boston (2005)
Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem. Manag. Sci. 40(10), 1276–1290 (1994)
Fonseca, C.M., Fleming, Peter, J., et al.: Genetic Algorithms for Multiobjective Optimization: Formulation, Discussion and Generalization. In: ICGA, pp. 416–423 (1993)
Dorigo, M., Birattari, M.: Ant colony optimization. In: Encyclopedia of Machine Learning, pp. 36–39. Springer, Boston (2011)
Poli, R., Kennedy, J., Blackwell, T.: Particle swarm optimization. Swarm Intell. 1(1), 33–57 (2007)
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)
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)
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)
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)
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)
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)
Reinelt, G.: TSPLIB—a travelling salesman problem library. ORSA J. Comput. 3(4), 376–384 (1991)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
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
DOI: https://doi.org/10.1007/978-3-030-12065-8_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-12064-1
Online ISBN: 978-3-030-12065-8
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)