Abstract
Combinatorial problems are often challenging and require creative thinking to find optimal solutions. These problems involve analysing and manipulating discrete objects or structures, such as permutations, combinations, graphs, or networks. In this paper, we present an application of the Elephant herding optimization (EHO) for solving the Quadratic assignment problem (QAP), which is one of the most popular combinatorial problems. The elephant herding optimization is a metaheuristic algorithm inspired by the herding behaviour of elephants in the wild. It simulates the collaboration and communication among elephants to find optimal solutions to continued optimization problems. To apply the Elephant herding optimization (EHO) to the QAP, we propose some adaptations to the EHO algorithm. The experiments are performed on a set of 25 benchmark QAPLIB instances.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Burkard, R.E.: Quadratic assignment problems. Eur. J. Oper. Res. 15(3), 283–289 (1984)
Silva, A., Coelho, L.C., Darvish, M.: Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search. Eur. J. Oper. Res. 292(3), 1066–1084 (2021). https://doi.org/10.1016/j.ejor.2020.11.035
Drezner, Z.: A new genetic algorithm for the quadratic assignment problem. INFORMS J. Comput. 15(3), 320–330 (2003). https://doi.org/10.1287/ijoc.15.3.320.16076
Zhang, H., Liu, F., Zhou, Y., Zhang, Z.: A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem. Inf. Sci. 539, 347–374 (2020). https://doi.org/10.1016/j.ins.2020.06.036
Dhungel, Y.: Simulated annealing heuristics for the dynamic generalized simulated annealing heuristics for the dynamic generalized quadratic assignment problem quadratic assignment problem (2022). https://researchrepository.wvu.edu/etd/11162
Pradeepmon, T.G., Panicker, V.V., Sridharan, R.: Parameter selection of discrete particle swarm optimization algorithm for the quadratic assignment problems. Procedia Technol. 25, 998–1005 (2016). https://doi.org/10.1016/j.protcy.2016.08.199
Demirel, N.Ç., Toksari, M.D.: Optimization of the quadratic assignment problem using an ant colony algorithm. Appl. Math. Comput. 183(1), 427–435 (2006). https://doi.org/10.1016/j.amc.2006.05.073
Wang, G.G., Deb, S., Gao, X.Z., Coelho, L.D.S.: A new metaheuristic optimisation algorithm motivated by elephant herding behaviour. Int. J. Bio-Inspir. Comput. 8(6), 394 (2016). https://doi.org/10.1504/IJBIC.2016.081335
Koopmans, T.C., Beckmann, M.: Assignment problems and the location of economic activities. Econometrica 25(1), 53–76 (1957). https://doi.org/10.2307/1907742
Wang, G.-G., Deb, S., Coelho, L.d.S.: Elephant herding optimization. In: 2015 3rd International Symposium on Computational and Business Intelligence (ISCBI), pp. 1–5. IEEE, December 2015. https://doi.org/10.1109/ISCBI.2015.8
Said, G.A.E.N.A., Mahmoud, A.M. and El-Horbaty, E.S.M.: A comparative study of meta-heuristic algorithms for solving quadratic assignment problem. Int. J. Adv. Comput. Sci. Appl. 5(1) (2014). https://doi.org/10.14569/ijacsa.2014.050101
Chmiel, W., Kadłuczka, P., Kwiecień, J., Filipowicz, B.: A comparison of nature inspired algorithms for the quadratic assignment problem. Bull. Pol. Acad. Sci. Techn. Sci. 65(4) (2017). https://doi.org/10.1515/bpasts-2017-0056
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Mohsine, S., Mzili, I., Riffi, M.E. (2024). Resolving the Quadratic Assignment Problem with the Elephant Herding Optimization. In: Ezziyyani, M., Kacprzyk, J., Balas, V.E. (eds) International Conference on Advanced Intelligent Systems for Sustainable Development (AI2SD'2023). AI2SD 2023. Lecture Notes in Networks and Systems, vol 931. Springer, Cham. https://doi.org/10.1007/978-3-031-54288-6_19
Download citation
DOI: https://doi.org/10.1007/978-3-031-54288-6_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-54287-9
Online ISBN: 978-3-031-54288-6
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)