Using Evolutionary Optimization Techniques to Improve the Efficiency of Transportation Scheduling

Mohd Khaled Yousef Shambour

Abstract


This study addresses the challenge of enhancing transportation efficiency during large-scale events, with a particular focus on the Hajj pilgrimage. Every year, more than two million pilgrims visit Makkah in Saudi Arabia to perform their Hajj rituals. The Haj ritual requires transporting vast numbers of pilgrims within a limited time, compounded by diverse transportation preferences that make timely, optimal scheduling complex. To tackle this, the study employs three optimization algorithms -Harmony Search (HS), Differential Evolution (DE), and Black Widow Optimization (BWO) - to optimize transportation schedules based on individual preferences. A comprehensive mathematical model was developed for this purpose, incorporating both hard and soft constraints that reflect the scheduling requirements and preferences of pilgrims. Experimental results show that the DE algorithm consistently outperforms HS and BWO, achieving the highest mean scores in 100% of scenarios with a population size of 100, 66.7% of scenarios with a population size of 20, and 16.7% of scenarios with a population size of 5. In contrast, BWO struggles to adapt to varying parameter settings, producing consistently lower-quality solutions. DE, in particular, performs exceptionally well with lower crossover probabilities, demonstrating its ability to balance exploration and exploitation effectively. On the other hand, HS yields better results when higher exploration probabilities are used, highlighting its strength in broader search space exploration. In contrast, the performance of BWO remains largely unaffected by variations in exploration and exploitation parameters, leading to consistently inferior solutions. These findings underscore the importance of dynamic parameter tuning for large-scale optimization tasks, suggesting that such approaches are promising for addressing complex scheduling challenges in major events like Hajj.

Keywords


Transportation; Optimal Scheduling; Hajj; Optimization Algorithms; Large-Scale Events

Full Text:

PDF

References


Z. W. Geem, J. H. Kim, and G. V. Loganathan, “A New Heuristic Optimization Algorithm: Harmony Search,” Simulation, vol. 76, no. 2, pp. 60–68, 2001, doi: 10.1177/003754970107600201.

V. Hayyolalam and A. A. Pourhaji Kazem, “Black Widow Optimization Algorithm: A novel meta-heuristic approach for solving engineering optimization problems,” Eng Appl Artif Intell, vol. 87, p. 103249, Jan. 2020.

Shambour Mohd Khaled, E. Khan, and A. Salibi, “Distribute Mina camps automatically to increase the capacity and efficiency,” in 17th Scientific Symposium for Hajj, Umrah & Madinah Visit, 2017, pp. 720–726. Accessed: Apr. 22, 2024.

M. K. Shambour and E. Khan, “A Heuristic Approach for Distributing Pilgrims over Mina Tents,” JKAU: Eng. Sci, vol. 30, no. 2, pp. 11–23, 2019, doi: 10.4197/Eng.

F. Rehman and E. Felemban, “A preference-based interactive tool for safe rescheduling of groups for hajj,” Proceedings of IEEE/ACS International Conference on Computer Systems and Applications, AICCSA, vol. 2019-November, Nov. 2019, doi: 10.1109/AICCSA47632.2019.9035318.

A. A. Morgan and K. M. J. Khayyat, “Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities,” International Transactions in Operational Research, vol. 29, no. 1, pp. 259–300, Jan. 2022, doi: 10.1111/ITOR.13026.

E. A. Khan and M. K. Shambour, “An optimized solution for the transportation scheduling of pilgrims in Hajj using harmony search algorithm,” Journal of Engineering Research, vol. 11, no. 2, p. 100038, Jun. 2023.

M. S. Yasein and E. A. Khan, “Optimizing Shuttle-Bus Systems in Mega-Events using Computer Modeling: A Case Study of Pilgrims’ Transportation System,” IJACSA) International Journal of Advanced Computer Science and Applications, vol. 14, no. 11, p. 2023, Accessed: Apr. 22, 2024.

E. Felemban, A. Fatani, and F. U. Rehman, “An Optimized Scheduling Process for a Large Crowd to Perform Spatio-temporal Movements Safely during Pilgrimage,” Proceedings - 2019 IEEE International Conference on Big Data, Big Data 2019, pp. 6049–6051, Dec. 2019.

Z. W. Geem, J. H. Kim, and G. V. Loganathan, “A New Heuristic Optimization Algorithm: Harmony Search,” Simulation, vol. 76, no. 2, pp. 60–68, 2001, doi: 10.1177/003754970107600201.

M. K. Shambour, A. T. Khader, A. Abusnaina, and Q. Shambour, “Modified tournament harmony search for unconstrained optimisation problems,” Advances in Intelligent Sys and Computing, vol. 287, pp. 283–292, 2014.

O. M. D. Alia and R. Mandava, “The variants of the harmony search algorithm: An overview,” Artif Intell Rev, vol. 36, no. 1, pp. 49–68, Jun. 2011, doi: 10.1007/S10462-010-9201-Y/METRICS.

M. K. Y. Shambour, “VIBRANT SEARCH MECHANISM FOR NUMERICAL OPTIMIZATION FUNCTIONS,” Journal of Information and Communication Technology, vol. 17, no. 4, pp. 679–702, Oct. 2018.

V. Hayyolalam and A. A. Pourhaji Kazem, “Black Widow Optimization Algorithm: A novel meta-heuristic approach for solving engineering optimization problems,” Eng Appl Artif Intell, vol. 87, p. 103249, Jan. 2020.

M. Madhiarasan, D. T. Cotfas, and P. A. Cotfas, “Black Widow Optimization Algorithm Used to Extract the Parameters of Photovoltaic Cells and Panels,” Mathematics, vol. 11, no. 4, p. 967, Feb. 2023.

M. A. Abu-Hashem and M. Khaled Shambour, “An improved black widow optimization (IBWO) algorithm for solving global optimization problems,” International Journal of Industrial Engineering Computations , pp. 1–16, 2024.

Storn, R. and Price, K., 1997. “Differential evolution–a simple and efficient heuristic for global optimization over continuous spaces”. Journal of global optimization, 11, pp.341-359.




DOI: https://doi.org/10.47738/jads.v6i2.581

Refbacks

  • There are currently no refbacks.



Barcode

Journal of Applied Data Sciences

ISSN:2723-6471 (Online)
Publisher:Bright Publisher
Website:http://bright-journal.org/JADS
Email:taqwa@amikompurwokerto.ac.id (principal contact)
  support@bright-journal.org (technical issues)

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0