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 条
  • [41] A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows
    Bettinelli A.
    Ceselli A.
    Righini G.
    Mathematical Programming Computation, 2014, 6 (02) : 171 - 197
  • [42] An Exact Algorithm for Multi-Task Large-Scale Inter-Satellite Routing Problem with Time Windows and Capacity Constraints
    Liu, Jinming
    Zhang, Guoting
    Xing, Lining
    Qi, Weihua
    Chen, Yingwu
    MATHEMATICS, 2022, 10 (21)
  • [43] Multi-objective Heterogeneous Capacitated Vehicle Routing Problem with Time Windows and Simultaneous Pickup and Delivery for Urban Last Mile Logistics
    Heng, Chen Kim
    Zhang, Allan N.
    Tan, Puay Siew
    Ong, Yew-Soon
    PROCEEDINGS OF THE 18TH ASIA PACIFIC SYMPOSIUM ON INTELLIGENT AND EVOLUTIONARY SYSTEMS, VOL 1, 2015, : 129 - 140
  • [44] A heuristic approach and a tabu search for the heterogeneous multi-type fleet vehicle routing problem with time windows and an incompatible loading constraint
    Wang, Zheng
    Li, Ying
    Hu, Xiangpei
    COMPUTERS & INDUSTRIAL ENGINEERING, 2015, 89 : 162 - 176
  • [45] Application of improved multi-objective particle swarm optimization algorithm to solve disruption for the two-stage vehicle routing problem with time windows
    Kuo, R. J.
    Luthfiansyah, Muhammad Fernanda
    Masruroh, Nur Aini
    Zulvia, Ferani Eva
    EXPERT SYSTEMS WITH APPLICATIONS, 2023, 225
  • [46] Artificial neural networks integrated mixed integer mathematical model for multi-fleet heterogeneous time-dependent cash in transit problem with time windows
    Ayyildiz, Ertugrul
    Taskin, Alev
    Yildiz, Aslihan
    Ozkan, Coskun
    NEURAL COMPUTING & APPLICATIONS, 2022, 34 (24): : 21891 - 21909
  • [47] Artificial neural networks integrated mixed integer mathematical model for multi-fleet heterogeneous time-dependent cash in transit problem with time windows
    Ertuğrul Ayyıldız
    Alev Taşkın
    Aslıhan Yıldız
    Coşkun Özkan
    Neural Computing and Applications, 2022, 34 : 21891 - 21909
  • [48] Artificial neural networks integrated mixed integer mathematical model for multi-fleet heterogeneous time-dependent cash in transit problem with time windows
    Ayyıldız, Ertuğrul
    Taşkın, Alev
    Yıldız, Aslıhan
    Özkan, Coşkun
    Neural Computing and Applications, 2022, 34 (24) : 21891 - 21909
  • [49] Cheapest Insertion and Disruption of Routes Operators for Solving Multi-Depot Electric Vehicle Location Routing Problem with Time Windows and Battery Swapping via GRASP and RVND
    Portela, Braulio M. O.
    Bernardino, Heder S.
    Goncalves, Luciana B.
    Soares, Stenio S. R. F.
    2021 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC 2021), 2021, : 2133 - 2140