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 条
  • [31] A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration
    Hernandez, F.
    Feillet, D.
    Giroudeau, R.
    Naud, O.
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2014, 12 (03): : 235 - 259
  • [32] Heuristic algorithms for solving the multi-compartment vehicle routing problem with time windows and heterogeneous fleet
    Topaloglu, Duygu
    Polat, Olcay
    Kalayci, Can Berk
    PAMUKKALE UNIVERSITY JOURNAL OF ENGINEERING SCIENCES-PAMUKKALE UNIVERSITESI MUHENDISLIK BILIMLERI DERGISI, 2023, 29 (08): : 870 - 884
  • [33] A multi-objective approach for unmanned aerial vehicle routing problem with soft time-windows constraints
    Guerriero, F.
    Surace, R.
    Loscri, V.
    Natalizio, E.
    APPLIED MATHEMATICAL MODELLING, 2014, 38 (03) : 839 - 852
  • [34] A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows
    Bettinelli, Andrea
    Ceselli, Alberto
    Righini, Giovanni
    TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2011, 19 (05) : 723 - 740
  • [35] Improved ant colony optimization for multi-depot heterogeneous vehicle routing problem with soft time windows
    Tang, Yalian
    Cai, Yanguang
    Yang, Qijiang
    Journal of Southeast University (English Edition), 2015, 31 (01) : 94 - 99
  • [36] Multi-depot heterogeneous fleet vehicle routing problem with time windows: Airline and roadway integrated routing
    Dursun, Omer Osman
    Ozger, Asuman
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2022, 13 (03) : 435 - 456
  • [37] Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
    Michallet, Julien
    Prins, Christian
    Amodeo, Lionel
    Yalaoui, Farouk
    Vitry, Gregoire
    COMPUTERS & OPERATIONS RESEARCH, 2014, 41 : 196 - 207
  • [38] A multi-trip vehicle routing problem considering time windows and limited duration under a heterogeneous fleet and parking constraints in cold supply chain logistics
    Chen, Yin-Yann
    Chen, Tzu-Li
    Chiu, Chun-Chih
    Wu, Yi-Jia
    TRANSPORTATION PLANNING AND TECHNOLOGY, 2023, 46 (03) : 335 - 358
  • [39] A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
    Dondo, Rodolfo
    Cerda, Jaime
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 176 (03) : 1478 - 1507
  • [40] Customer-oriented multi-objective optimization on a novel collaborative multi-heterogeneous-depot electric vehicle routing problem with mixed time windows
    Zhou, Tong
    Zhang, Shuai
    Zhang, Dongping
    Chan, Verner
    Yang, Sihan
    Chen, Mengjiao
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2023, 44 (03) : 3787 - 3805