Abstract

The pilgrimage to Mecca, which is called Hajj, is the largest annual pedestrian crowd management problem in the world. During the Hajj, the pilgrims are accommodated in camps. For safety reasons, exact times and directions are given to the pilgrims who are moving between holy sites. Despite the importance of complying with those schedules, violations can often be conjectured. Directing a small workforce between the camps to monitor the pilgrims’ compliance with the schedule is an important matter, which will be dealt with in this paper. A type of multi-objective multiple traveling salesperson optimization problem with time windows is introduced to generate the tours for the employees monitoring the flow of pilgrims at the campsite. Four objectives are being pursued: As many pilgrims as possible (1), should be visited with a preferably small workforce (2), the tours of the employees should be short (3) and employees should have short waiting times between visits (4). A goal programming, an enumeration, Augmecon2 and an interactive approach are developed. The topic of supported and non-supported efficient solutions is addressed by determining all efficient solutions with the enumeration approach. The suitability of the approaches is analyzed in a computational study, while using an actual data set of the Hajj season in 2015. For this application, the interactive approach has been identified as the most suitable approach to support the generation of an offer for the project.

Highlights

  • Each year the Hajj attracts two to four million people

  • The set of non-supported efficient solutions, contains the solutions that cannot be found with this single objective function

  • The focus of this paper is the suitability of different approaches for Multi-objective combinatorial optimization (MOCO) problems

Read more

Summary

Background

Each year the Hajj attracts two to four million people. See Haase et al (2016) for a detailed description of the pilgrimage. It shows the fraction of pilgrims arriving on time at the corresponding metro. A workforce was gathered and they have been directed to the camps to monitor the dispatching process They used a mobile application to send the dispatching status to a central server, which stores the incoming data. All solution approaches use the actual schedule data This includes the actual location of the camps with their corresponding number of accommodated pilgrims as well as their scheduled departure time.

Literature
Multi-objective multiple traveling salesperson problem with time windows
Data description and model performance
Goal programming
Objective
Enumeration of efficient solutions
Augmecon2
Objective k
Comparison
Objectives fk m pilgrims
Managerial implications
Findings
Conclusion and outlook
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.