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

被引:27
作者
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
相关论文
共 81 条
[1]   The capacitated team orienteering and profitable tour problems [J].
Archetti, C. ;
Feillet, D. ;
Hertz, A. ;
Speranza, M. G. .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2009, 60 (06) :831-842
[2]   Metaheuristics for the team orienteering problem [J].
Archetti, Claudia ;
Hertz, Alain ;
Speranza, Maria Grazia .
JOURNAL OF HEURISTICS, 2007, 13 (01) :49-76
[3]  
Archetti C, 2014, MOS-SIAM SER OPTIMIZ, P273
[4]   The capacitated team orienteering problem with incomplete service [J].
Archetti, Claudia ;
Bianchessi, Nicola ;
Speranza, M. Grazia .
OPTIMIZATION LETTERS, 2013, 7 (07) :1405-1417
[5]  
Bayliss C, 2020, APPL SOFT COMPUT, V92, DOI 10.1016/j.asoc.2020.106280
[6]   Re-thinking sustainability and food in tourism [J].
Bertella, Giovanna .
ANNALS OF TOURISM RESEARCH, 2020, 84
[7]  
Bouly H, 2009, 4OR-Q J OPER RES
[8]   An exact algorithm for team orienteering problems [J].
Boussier, Sylvain ;
Feillet, Dominique ;
Gendreau, Michel .
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2007, 5 (03) :211-230
[9]   Where Shall We Go Today? Planning Touristic Tours with TripBuilder [J].
Brilhante, Igo ;
Macedo, Jose Antonio ;
Nardini, Franco Maria ;
Perego, Raffaele ;
Renso, Chiara .
PROCEEDINGS OF THE 22ND ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM'13), 2013, :757-762
[10]   Multi-agent orienteering problem with time-dependent capacity constraints [J].
Cheng, Shih-Fen, 1600, IOS Press BV (12) :347-358