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 条
  • [21] Hybrid Metaheuristic to Solve the Selective Multi-compartment Vehicle Routing Problem with Time Windows
    Kaabi, Hadhami
    PROCEEDINGS OF THE SECOND INTERNATIONAL AFRO-EUROPEAN CONFERENCE FOR INDUSTRIAL ADVANCEMENT (AECIA 2015), 2016, 427 : 185 - 194
  • [22] A GRASP-VND algorithm to solve the multi-objective fuzzy and sustainable Tourist Trip Design Problem for groups
    Ruiz-Meza, Jose
    Brito, Julio
    Montoya-Torres, Jairo R.
    APPLIED SOFT COMPUTING, 2022, 131
  • [23] A Study of the Multi-Trip Vehicle Routing Problem with Time Windows and Heterogeneous Fleet
    Despaux, Francois
    Basterrech, Sebastian
    2014 14TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS (ISDA 2014), 2014,
  • [24] Evolutionary Local Search Algorithm to Solve the Multi-Compartment Vehicle Routing Problem with Time Windows
    Melechovsky, Jan
    PROCEEDINGS OF 30TH INTERNATIONAL CONFERENCE MATHEMATICAL METHODS IN ECONOMICS, PTS I AND II, 2012, : 564 - 568
  • [25] Multi-Trip Vehicle Routing Problem with Time Windows and Resource Synchronization on Heterogeneous Facilities
    Xu, Rui
    Li, Shumin
    Wu, Jiayan
    SYSTEMS, 2023, 11 (08):
  • [26] Multi-Trip Time-Dependent Vehicle Routing Problem with Soft Time Windows and Overtime Constraints
    Karoonsoontawong, Ampol
    Punyim, Puntipa
    Nueangnitnaraporn, Wanvara
    Ratanavaraha, Vatanavongs
    NETWORKS & SPATIAL ECONOMICS, 2020, 20 (02): : 549 - 598
  • [27] Multi-Trip Time-Dependent Vehicle Routing Problem with Soft Time Windows and Overtime Constraints
    Ampol Karoonsoontawong
    Puntipa Punyim
    Wanvara Nueangnitnaraporn
    Vatanavongs Ratanavaraha
    Networks and Spatial Economics, 2020, 20 : 549 - 598
  • [28] A Branch and Price Algorithm for the Heterogeneous Fleet Multi-Depot Multi-Trip Vehicle Routing Problem with Time Windows
    Sahin, Munise Kubra
    Yamana, Hande
    TRANSPORTATION SCIENCE, 2022, 56 (06) : 1636 - 1657
  • [29] Multi-dimensional labelling approaches to solve the linear fractional elementary shortest path problem with time windows
    Guerriero, F.
    Pugliese, L. Di Puglia
    OPTIMIZATION METHODS & SOFTWARE, 2011, 26 (02): : 295 - 340
  • [30] A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration
    F. Hernandez
    D. Feillet
    R. Giroudeau
    O. Naud
    4OR, 2014, 12 : 235 - 259