The time-dependent orienteering problem with time windows: a fast ant colony system

This paper proposes a fast ant colony system based solution method to solve realistic instances of the time-dependent orienteering problem with time windows within a few seconds of computation time. Orienteering problems occur in logistic situations where an optimal combination of locations needs to be selected and the routing between these selected locations needs to be optimized. For the time-dependent problem, the travel time between two locations depends on the departure time at the first location. The main contribution of this paper is the design of a fast and effective algorithm for this problem. Numerous experiments on realistic benchmark instances with varying size confirm the state-of-the-art performance and practical relevance of the algorithm.

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

[2]  Daoli Zhu,et al.  Study on the Time-Dependent Orienteering Problem , 2010, 2010 International Conference on E-Product E-Service and E-Entertainment.

[3]  Rakesh Nagi,et al.  Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans , 2012, Comput. Oper. Res..

[4]  Erwin W. Hans,et al.  Vehicle routing under time-dependent travel times: The impact of congestion avoidance , 2012, Comput. Oper. Res..

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

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

[7]  Daniel N. Reber,et al.  Optimized Routing of Unmanned Aerial Systems for the Interdiction of Improvised Explosive Devices , 2009 .

[8]  El Houssaine Aghezzaf,et al.  Analysis of the single-vehicle cyclic inventory routing problem , 2012, Int. J. Syst. Sci..

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

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

[11]  R. Vohra,et al.  The Orienteering Problem , 1987 .

[12]  Richard F. Hartl,et al.  Variable Neighborhood Search for the Time-Dependent Vehicle Routing Problem with Soft Time Windows , 2011, LION.

[13]  Michel Gendreau,et al.  Vehicle dispatching with time-dependent travel times , 2003, Eur. J. Oper. Res..

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

[15]  Eulalia Martínez,et al.  A way to optimally solve a time-dependent Vehicle Routing Problem with Time Windows , 2009, Oper. Res. Lett..

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

[17]  Suzanne van der Ster,et al.  The Orienteering Problem under Uncertainty Stochastic Programming and Robust Optimization compared , 2012 .

[18]  Nico Vandaele,et al.  Vehicle routing with dynamic travel times: A queueing approach , 2008, Eur. J. Oper. Res..

[19]  Jean-Yves Potvin,et al.  Vehicle routing and scheduling with dynamic travel times , 2006, Comput. Oper. Res..

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

[21]  Hideki Hashimoto,et al.  An iterated local search algorithm for the time-dependent vehicle routing problem with time windows , 2008, Discret. Optim..

[22]  Jin Li,et al.  Model and Algorithm for Time-Dependent Team Orienteering Problem , 2011 .

[23]  Herbert Peremans,et al.  Vehicle routing with stochastic time-dependent travel times , 2009, 4OR.

[24]  Mei-Shiang Chang,et al.  The real-time time-dependent vehicle routing problem , 2006 .

[25]  Andrzej Lingas,et al.  Approximation algorithms for time-dependent orienteering , 2002, Inf. Process. Lett..

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

[27]  Bruce L. Golden,et al.  The vehicle routing problem : latest advances and new challenges , 2008 .

[28]  Charalampos Konstantopoulos,et al.  Efficient Heuristics for the Time Dependent Team Orienteering Problem with Time Windows , 2014, ICAA.

[29]  Ali Haghani,et al.  A dynamic vehicle routing problem with time-dependent travel times , 2005, Comput. Oper. Res..

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

[31]  Irene Loiseau,et al.  An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows , 2011, Comput. Oper. Res..

[32]  M. G. Kantor,et al.  The Orienteering Problem with Time Windows , 1992 .

[33]  Roberto Montemanni,et al.  Time dependent vehicle routing problem with a multi ant colony system , 2008, Eur. J. Oper. Res..

[34]  Carlos Cotta,et al.  Adaptive and multilevel metaheuristics , 2008 .

[35]  C. Verbeeck,et al.  A fast solution method for the time-dependent orienteering problem , 2013, Eur. J. Oper. Res..

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

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