Tareq Hamadneh, Belal Batiha, Oqlah Al-Refai, Mahmood Anees Ahmed, Aseel Smerat, Zeinab Montazeri, Mohammad Dehghani, Widi Aribowo, Asaad Abdul Malik Madhloom AL-Salih, Ibraheem Kasim Ibraheem, Kei Eguchi
This paper evaluates the performance of the recently published Perfumer Optimization Algorithm (POA) in solving routing problems in transportation networks. In this study, POA is compared with 9 other metaheuristic algorithms for routing optimization across four different case studies. The mathematical model for routing is designed based on transportation network concepts and includes various constraints such as vehicle capacity, scheduling limitations, and travel costs. POA, inspired by perfume design techniques similar to the perfume-making process, effectively divides the search process into two phases: exploration and exploitation. This algorithm is capable of efficiently exploring the search space and then improving locally with precision. Simulation results show that POA significantly outperforms other algorithms in solving routing problems with minimal operational costs, accurate scheduling management, and vehicle capacity handling. Furthermore, POA is recognized as an advanced algorithm for solving complex routing issues in transportation networks. © This article is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. License details: https://creativecommons.org/licenses/by-sa/4.0/
Department of Mathematics, Al Zaytoonah University of Jordan, Amman, 11733, Jordan; Department of Mathematics, Faculty of Science and Information Technology, Jadara University, Irbid, 21110, Jordan; Department of Mathematics, Faculty of Science, Zarqa University, Zarqa, 13132, Jordan; Department of Medical Instrumentation Techniques Engineering, Department College of medical techniques, Al-Farahidi University, Baghdad, 10001, Iraq; Faculty of Educational Sciences, Al-Ahliyya Amman University, Amman, 19328, Jordan; Department of Biosciences, Saveetha School of Engineering, Saveetha Institute of Medical and Technical Sciences, Chennai, 602105, India; Computer Technologies Engineering, Mazaya University College, Nasiriyah, Iraq; Department of Electrical and Electronics Engineering, Shiraz University of Technology, Shiraz, 7155713876, Iran; Department of Electrical Engineering, Faculty of Vocational Studies, Universitas Negeri Surabaya, East Java, Surabaya, 60231, Indonesia; Department of Computer Engineering Techniques, Al-Nukhba University College, Baghdad, 10013, Iraq; Department of Electrical Engineering, College of Engineering, University of Baghdad, Baghdad, 10001, Iraq; Department of Information Electronics, Fukuoka Institute of Technology, Japan
