Team orienteering problem with time windows and time-dependent scores

Abstract This study investigates the team orienteering problem with time windows and time-dependent scores (TOPTW-TDS), which is a new variant of the well-known team orienteering problem with time windows (TOPTW). TOPTW-TDS builds a set of paths to maximize the collected scores. The score of visiting an attraction is different depending on the time of visit. A mathematical formulation is proposed for this new problem. Since the problem is NP-hard, a hybrid artificial bee colony (HABC) algorithm is proposed to find the optimal solutions for small instances and near-optimal solutions for larger instances. Three datasets (small, medium and large) are generated with 168 TOPTW-TDS instances. Computational results reveal that the proposed HABC algorithm can generate high-quality TOPTW-TDS solutions. The proposed HABC obtains the optimal solution of each small TOPTW-TDS instance. For medium and large TOPTW-TDS instances, HABC results are comparable with the SA results. Additionally, results from solving TOPTW benchmark instances indicate that the proposed HABC compares well with the state-of-the-art algorithms for TOPTW.

[1]  Shih-Wei Lin,et al.  A simulated annealing heuristic for the team orienteering problem with time windows , 2012, Eur. J. Oper. Res..

[2]  Dirk Van Oudheusden,et al.  A PERSONALIZED TOURIST TRIP DESIGN ALGORITHM FOR MOBILE TOURIST GUIDES , 2008, Appl. Artif. Intell..

[3]  Roberto Montemanni,et al.  An ant colony system for team orienteering problems with time windows , 2023, 2305.07305.

[4]  Alkın Yurtkuran,et al.  A discrete artificial bee colony algorithm for single machine scheduling problems , 2016 .

[5]  Kamel Kara,et al.  An efficient artificial bee colony algorithm with application to nonlinear predictive control , 2016, Int. J. Gen. Syst..

[6]  Zuren Feng,et al.  Ants can solve the team orienteering problem , 2008, Comput. Ind. Eng..

[7]  Maria Grazia Speranza,et al.  A branch-and-cut algorithm for the Team Orienteering Problem , 2018, Int. Trans. Oper. Res..

[8]  Hoong Chuin Lau,et al.  Well-tuned algorithms for the Team Orienteering Problem with Time Windows , 2017, J. Oper. Res. Soc..

[9]  Xia Wang,et al.  Using a Genetic Algorithm to Solve the Generalized Orienteering Problem , 2008 .

[10]  Dirk Van Oudheusden,et al.  The Mobile Tourist Guide: An OR Opportunity , 2007, OR Insight.

[11]  Dervis Karaboga,et al.  A comprehensive survey: artificial bee colony (ABC) algorithm and applications , 2012, Artificial Intelligence Review.

[12]  Bruce L. Golden,et al.  The team orienteering problem , 1996 .

[13]  Richard F. Hartl,et al.  Heuristics for the multi-period orienteering problem with multiple time windows , 2010, Comput. Oper. Res..

[14]  Rafael Caballero,et al.  Interactive design of personalised tourism routes , 2012 .

[15]  Elise Miller-Hooks,et al.  A TABU search heuristic for the team orienteering problem , 2005, Comput. Oper. Res..

[16]  Tunchan Cura,et al.  An artificial bee colony algorithm approach for the team orienteering problem with time windows , 2014, Comput. Ind. Eng..

[17]  Dirk Van Oudheusden,et al.  The City Trip Planner: An expert system for tourists , 2011, Expert Syst. Appl..

[18]  Shiuan Wan,et al.  A novel study of artificial bee colony with clustering technique on paddy rice image classification , 2017, Arabian Journal of Geosciences.

[19]  J. Q. Hu,et al.  On the tour planning problem , 2012, Ann. Oper. Res..

[20]  Dirk Van Oudheusden,et al.  A guided local search metaheuristic for the team orienteering problem , 2009, Eur. J. Oper. Res..

[21]  Giovanni Righini,et al.  Decremental state space relaxation strategies and initialization heuristics for solving the Orienteering Problem with Time Windows with dynamic programming , 2009, Comput. Oper. Res..

[22]  T. Tsiligirides,et al.  Heuristic Methods Applied to Orienteering , 1984 .

[23]  Richard F. Hartl,et al.  Metaheuristics for the bi-objective orienteering problem , 2009, Swarm Intelligence.

[24]  Dirk Van Oudheusden,et al.  The Multiconstraint Team Orienteering Problem with Multiple Time Windows , 2010, Transp. Sci..

[25]  Michel Gendreau,et al.  The orienteering problem with stochastic travel and service times , 2011, Ann. Oper. Res..

[26]  Onder Bulut,et al.  An artificial bee colony algorithm for the economic lot scheduling problem , 2014 .

[27]  Matteo Fischetti,et al.  Solving the Orienteering Problem through Branch-and-Cut , 1998, INFORMS J. Comput..

[28]  Nacima Labadie,et al.  The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search , 2012, Eur. J. Oper. Res..

[29]  Kan Wu,et al.  A multiple colonies artificial bee colony algorithm for a capacitated vehicle routing problem and re-routing strategies under time-dependent traffic congestion , 2017, Comput. Ind. Eng..

[30]  Ray Deitch,et al.  The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm , 2000, Eur. J. Oper. Res..

[31]  Dirk Van Oudheusden,et al.  The orienteering problem: A survey , 2011, Eur. J. Oper. Res..

[32]  Charalampos Konstantopoulos,et al.  Heuristics for the time dependent team orienteering problem: Application to tourist route planning , 2015, Comput. Oper. Res..

[33]  Olatz Arbelaitz,et al.  Integrating public transportation in personalised electronic tourist guides , 2013, Comput. Oper. Res..

[34]  Michel Gendreau,et al.  An exact algorithm for team orienteering problems , 2007, 4OR.

[35]  Farhad Samadzadegan,et al.  Time-dependent personal tour planning and scheduling in metropolises , 2011, Expert Syst. Appl..

[36]  Andrew Lim,et al.  An iterative three-component heuristic for the team orienteering problem with time windows , 2014, Eur. J. Oper. Res..

[37]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[38]  Hoong Chuin Lau,et al.  Orienteering Problem: A survey of recent variants, solution approaches and applications , 2016, Eur. J. Oper. Res..

[39]  Bruce L. Golden,et al.  A fast and effective heuristic for the orienteering problem , 1996 .

[40]  Dirk Van Oudheusden,et al.  Iterated local search for the team orienteering problem with time windows , 2009, Comput. Oper. Res..

[41]  Nacima Labadie,et al.  Hybridized evolutionary local search algorithm for the team orienteering problem with time windows , 2011, J. Heuristics.

[42]  Ching-Jung Ting,et al.  Two-level particle swarm optimization for the multi-modal team orienteering problem with time windows , 2017, Appl. Soft Comput..

[43]  Rozaida Ghazali,et al.  Functional Link Neural Network with Modified Artificial Bee Colony for Data Classification , 2017, Int. J. Intell. Inf. Technol..

[44]  Trung Thanh Nguyen,et al.  A hybrid algorithm for a vehicle routing problem with realistic constraints , 2017, Inf. Sci..