A GRASP to solve the multi-constraints multi-modal team orienteering problem with time windows for groups with heterogeneous preferences

被引:23
|
作者
Ruiz-Meza, Jose [1 ,2 ]
Brito, Julio [3 ]
Montoya-Torres, Jairo R. [1 ]
机构
[1] Univ La Sabana, Fac Ingn, Km 7 Autopista Norte Bogota, Chia, Cundinamarca, Colombia
[2] Univ Nacl Abierta & Distancia, Escuela Ciencias Basicas Tecnol & Ingn, Bogota, Colombia
[3] Univ La Laguna, Inst Univ Desarrollo Reg, Dept Ingn Informat & Sistemas, San Cristobal De Laguna, Spain
关键词
Tourist Trip Design Problem; Team orienteering problem; Multi-modal; Heterogeneous preferences; Time windows; Greedy randomised adaptive search procedure; TOURIST TRIP DESIGN; HEURISTIC ALGORITHM; ROUTE; TRANSPORTATION; OPTIMIZATION; SEARCH; SYSTEM;
D O I
10.1016/j.cie.2021.107776
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Improving the travel experience is a goal of tourist destinations. Tourists demand information and services that help plan and organise the trips adapted to their preferences and resources. Intelligent systems, recommendation systems, and electronic tourist guides can play a decisive role in tourist satisfaction and shaping the offer at the destination. These systems must satisfy the interests of tourists which travel alone or as a group. However, the development of these tools to generate group tourism itineraries is still limited. Group itineraries must also consider individual preferences and the selection of transport modes. The problem associated with the construction of tourist routes is called the Tourist Trip Design Problem. In this work, an extension of the Team Orienteering Problem with Time Windows is developed to model tourism planning. The model considers the construction of group routes, a cost and time limit associated with each participant, the selection of the mode of transport to go from one location to another, and heterogeneous preferences in the group. The model aims to maximise the preferences of group members by considering real and challenging constraints that increase complexity and avoid solutions in polynomial time. This is a novel model, and we generate sets of instances to assess the accuracy of our solution approach. A Greedy Randomised Adaptive Search Procedure is proposed to solve the model. Evaluation criteria based on time, cost, and preferences are used to guide the candidate's selection in the construction phase. The results provided by our meta-heuristic are compared with those obtained by solving the Mixed Integer Programming formulation with exact solver. Computational results show the effectiveness and efficiency of the proposed approach.
引用
收藏
页数:12
相关论文
共 49 条
  • [1] Two-level particle swarm optimization for the multi-modal team orienteering problem with time windows
    Yu, Vincent F.
    Jewpanya, Parida
    Ting, Ching-Jung
    Redi, A. A. N. Perwira
    APPLIED SOFT COMPUTING, 2017, 61 : 1022 - 1040
  • [2] Multi-agent Deep Reinforcement Learning for Multi-modal Orienteering Problem
    Liu, Wei
    Li, Kaiwen
    Li, Wenhua
    Wang, Rui
    Zhang, Tao
    18TH INTERNATIONAL SYMPOSIUM ON APPLIED COMPUTATIONAL INTELLIGENCE AND INFORMATICS, SACI 2024, 2024, : 169 - 174
  • [3] The multi-visit team orienteering problem with precedence constraints
    Hanafi, Said
    Mansini, Renata
    Zanotti, Roberto
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 282 (02) : 515 - 529
  • [4] Solving the team orienteering problem with time windows and mandatory visits by multi-start simulated annealing
    Lin, Shih-Wei
    Yu, Vincent F.
    COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 114 : 195 - 205
  • [5] GRASP-ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows
    Yahiaoui, Ala-Eddine
    Moukrim, Aziz
    Serairi, Mehdi
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2023, 30 (02) : 946 - 969
  • [6] Heuristics for the multi-period orienteering problem with multiple time windows
    Tricoire, Fabien
    Romauch, Martin
    Doerner, Karl F.
    Hartl, Richard F.
    COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (02) : 351 - 367
  • [7] 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.
    APPLIED SOFT COMPUTING, 2018, 73 : 383 - 393
  • [8] The multi-constraint team orienteering problem with time windows in the context of distribution problems: A variable neighborhood search algorithm
    Aghezzaf, Brahim
    El Fahim, Hassan
    PROCEEDINGS OF 2014 2ND IEEE INTERNATIONAL CONFERENCE ON LOGISTICS AND OPERATIONS MANAGEMENT (GOL 2014), 2014, : 155 - +
  • [9] Optimal Multi-modal Transport Model for Full Loads with Time Windows
    Cai Yiping
    Zhang Lei
    Shao Luning
    PROCEEDINGS OF 2010 INTERNATIONAL CONFERENCE ON LOGISTICS SYSTEMS AND INTELLIGENT MANAGEMENT, VOLS 1-3, 2010, : 147 - +
  • [10] Three-stage multi-modal multi-objective differential evolution algorithm for vehicle routing problem with time windows
    Zhang, Hai-Fei
    Ge, Hong-Wei
    Li, Ting
    Su, ShuZhi
    Tong, YuBing
    INTELLIGENT DATA ANALYSIS, 2024, 28 (02) : 485 - 506