Application of a multi-objective multi traveling salesperson problem with time windows

被引:3
|
作者
Bonz, Justus [1 ]
机构
[1] Univ Hamburg, Hamburg, Germany
关键词
Multi-objective multiple traveling salesperson; Time windows; Hajj; Mass gatherings; Non-supported efficient solutions; EPSILON-CONSTRAINT METHOD; SALESMAN PROBLEM; LOCAL SEARCH; ALGORITHMS; SET;
D O I
10.1007/s12469-020-00258-6
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
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.
引用
收藏
页码:35 / 57
页数:23
相关论文
共 50 条
  • [1] Application of a multi-objective multi traveling salesperson problem with time windows
    Justus Bonz
    [J]. Public Transport, 2021, 13 : 35 - 57
  • [2] Bicriterion Coevolution for the Multi-objective Travelling Salesperson Problem
    Liu, Ying Ying
    Thulasiraman, Parimala
    Pillay, Nelishia
    [J]. 2022 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2022,
  • [3] The Multi-Objective Multi-Vehicle Pickup and Delivery Problem with Time Windows
    Grandinetti, L.
    Guerriero, F.
    Pezzella, F.
    Pisacane, O.
    [J]. TRANSPORTATION: CAN WE DO MORE WITH LESS RESOURCES? - 16TH MEETING OF THE EURO WORKING GROUP ON TRANSPORTATION - PORTO 2013, 2014, 111 : 203 - 212
  • [4] Stochastic Multi-Objective Multi-Trip AMR Routing Problem with Time Windows
    Cheng, Lulu
    Zhao, Ning
    Wu, Kan
    [J]. MATHEMATICS, 2024, 12 (15)
  • [5] Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows
    Beatrice Ombuki
    Brian J. Ross
    Franklin Hanshar
    [J]. Applied Intelligence, 2006, 24 : 17 - 30
  • [6] An Evolutionary Approach to the Multi-objective Pickup and Delivery Problem with Time Windows
    Garcia-Najera, Abel
    Angel Gutierrez-Andrade, Miguel
    [J]. 2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2013, : 997 - 1004
  • [7] Multi-objective genetic algorithms for vehicle routing problem with time windows
    Ombuki, B
    Ross, BJ
    Hanshar, F
    [J]. APPLIED INTELLIGENCE, 2006, 24 (01) : 17 - 30
  • [8] Solving Multi-objective Vehicle Routing Problem with Time Windows by FAGA
    Kumar, V. Sivaram
    Thansekhar, M. R.
    Saravanan, R.
    Amali, S. Miruna Joe
    [J]. 12TH GLOBAL CONGRESS ON MANUFACTURING AND MANAGEMENT (GCMM - 2014), 2014, 97 : 2176 - 2185
  • [9] A multi-objective dynamic vehicle routing problem with fuzzy time windows: Model, solution and application
    Ghannadpour, Syed Farid
    Noori, Simak
    Tavakkoli-Moghaddam, Reza
    Ghoseiri, Keivan
    [J]. APPLIED SOFT COMPUTING, 2014, 14 : 504 - 527
  • [10] A multi-objective evolutionary algorithm based on decomposition and constraint programming for the multi-objective team orienteering problem with time windows
    Hu, Wanzhe
    Fathi, Mahdi
    Pardalos, Panos M.
    [J]. APPLIED SOFT COMPUTING, 2018, 73 : 383 - 393