Optimizing practical orienteering problems with stochastic time-dependent travel times: towards congestion free routes

[1]  Stephen D. Clark,et al.  Modelling network travel time reliability under stochastic demand , 2005 .

[2]  E. Forgy,et al.  Cluster analysis of multivariate data : efficiency versus interpretability of classifications , 1965 .

[3]  Alain Hertz,et al.  Metaheuristics for the team orienteering problem , 2005, J. Heuristics.

[4]  Duc-Cuong Dang,et al.  An effective PSO-inspired algorithm for the team orienteering problem , 2013, Eur. J. Oper. Res..

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

[6]  Qiang Meng,et al.  Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots , 2008, Math. Comput. Model..

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

[8]  Enrico Angelelli,et al.  The Clustered Orienteering Problem , 2014, Eur. J. Oper. Res..

[9]  Peter J. Bickel,et al.  Day-to-Day Travel-Time Trends and Travel-Time Prediction from Loop-Detector Data , 2000 .

[10]  Richard W. Eglese,et al.  Minimum cost VRP with time-dependent speed data and congestion charge , 2015, Comput. Oper. Res..

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

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

[13]  Michel Gendreau,et al.  Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach , 2014, Eur. J. Oper. Res..

[14]  Giovanni Righini,et al.  New dynamic programming algorithms for the resource constrained elementary shortest path problem , 2008, Networks.

[15]  Maria Grazia Speranza,et al.  The capacitated team orienteering problem with incomplete service , 2013, Optim. Lett..

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

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

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

[19]  Tom Van Woensel,et al.  Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows , 2013, Transp. Sci..

[20]  Michel Gendreau,et al.  A branch-and-cut algorithm for the undirected selective traveling salesman problem , 1998, Networks.

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

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

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

[24]  Yiyo Kuo,et al.  Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem , 2010, Comput. Ind. Eng..

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

[26]  Shih-Wei Lin,et al.  Solving the team orienteering problem using effective multi-start simulated annealing , 2013, Appl. Soft Comput..

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

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

[29]  S. Kulturel-Konak,et al.  Meta heuristics for the orienteering problem , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[30]  Zong Woo Geem,et al.  Harmony Search for Generalized Orienteering Problem: Best Touring in China , 2005, ICNC.

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

[32]  Pieter Vansteenwegen,et al.  Planning in tourism and public transportation , 2009, 4OR.

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

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

[35]  D. S. Berry,et al.  Distribution of Vehicle Speeds and Travel Times , 1951 .

[36]  Shu Zhang,et al.  A priori orienteering with time windows and stochastic wait times at customers , 2014, Eur. J. Oper. Res..

[37]  Christos D. Tarantilis,et al.  The Capacitated Team Orienteering Problem: A Bi-level Filter-and-Fan method , 2013, Eur. J. Oper. Res..

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

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

[40]  Joanna Karbowska-Chilinska,et al.  Genetic Algorithm with Path Relinking for the Orienteering Problem with Time Windows , 2014, CS&P.

[41]  Suzanne van der Ster,et al.  A two-stage approach to the orienteering problem with stochastic weights , 2014, Comput. Oper. Res..

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

[43]  Roberto Montemanni,et al.  A sampling-based approximation of the objective function of the Orienteering problem with stochastic travel and service times , 2013 .

[44]  Albert P. M. Wagelmans,et al.  Online stochastic UAV mission planning with time windows and time-sensitive targets , 2014, Eur. J. Oper. Res..

[45]  Johannes O. Royset,et al.  Generalized orienteering problem with resource dependent rewards , 2013 .

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

[47]  G. V. Berghe,et al.  Metaheuristics for Tourist Trip Planning , 2009 .

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

[49]  W. Art Chaovalitwongse,et al.  Integrated Ant Colony and Tabu Search approach for time dependent vehicle routing problems with simultaneous pickup and delivery , 2014, J. Comb. Optim..

[50]  Emanuele Manni,et al.  Scheduled penalty Variable Neighborhood Search , 2014, Comput. Oper. Res..

[51]  Elise Miller-Hooks,et al.  Algorithms for a stochastic selective travelling salesperson problem , 2005, J. Oper. Res. Soc..

[52]  Dirk Van Oudheusden,et al.  A Path Relinking approach for the Team Orienteering Problem , 2010, Comput. Oper. Res..

[53]  Richard F. Hartl,et al.  Applying the ANT System to the Vehicle Routing Problem , 1999 .

[54]  Gilbert Laporte,et al.  The orienteering problem with variable profits , 2013, Networks.

[55]  Larry W. Lake,et al.  Discretization, Simulation, and Swanson's (Inaccurate) Mean , 2011 .

[56]  H. L. Ong,et al.  An Integer L-shaped Algorithm for Time-Constrained Traveling Salesman Problem with Stochastic Travel and Service times , 2004, Asia Pac. J. Oper. Res..

[57]  Andrew Lim,et al.  An adaptive ejection pool with toggle-rule diversification approach for the capacitated team orienteering problem , 2013, Eur. J. Oper. Res..

[58]  L. B. Fu,et al.  Expected Shortest Paths in Dynamic and Stochastic Traf c Networks , 1998 .

[59]  El-Houssaine Aghezzaf,et al.  An extension of the arc orienteering problem and its application to cycle trip planning , 2014 .

[60]  Bruce L. Golden,et al.  A worst-case analysis for the split delivery capacitated team orienteering problem with minimum delivery amounts , 2014, Optim. Lett..

[61]  Stephen C. H. Leung,et al.  Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm , 2010 .

[62]  Shichao Sun,et al.  Urban Freight Management with Stochastic Time-Dependent Travel Times and Application to Large-Scale Transportation Networks , 2015 .

[63]  Francesco Viti,et al.  Improving the efficiency of repeated dynamic network loading through marginal simulation , 2014 .

[64]  Aise Zülal Sevkli,et al.  Variable Neighborhood Search for the Orienteering Problem , 2006, ISCIS.

[65]  Qiwen Wang,et al.  Using artificial neural networks to solve the orienteering problem , 1995, Ann. Oper. Res..

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

[67]  Bin Ran,et al.  Temporal and Spatial Variability of Travel Time , 2002 .

[68]  Bernhard Fleischmann,et al.  Time-Varying Travel Times in Vehicle Routing , 2004, Transp. Sci..

[69]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

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

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

[72]  Lidija Zadnik Stirn,et al.  A vehicle routing algorithm for the distribution of fresh vegetables and similar perishable food , 2008 .

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

[74]  Tom M. Cavalier,et al.  A heuristic for the multiple tour maximum collection problem , 1994, Comput. Oper. Res..

[75]  Michel Gendreau,et al.  Traveling Salesman Problems with Profits , 2005, Transp. Sci..

[76]  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..

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

[78]  Mark S. Daskin,et al.  Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms , 1992, Transp. Sci..

[79]  Heidrun Belzner,et al.  A New Measure of Travel Time Reliability for In-Vehicle Navigation Systems , 2008, J. Intell. Transp. Syst..

[80]  Alain Hertz,et al.  The split delivery capacitated team orienteering problem , 2010, Networks.

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

[82]  Giovanni Righini,et al.  Dynamic programming for the orienteering problem with time windows , 2006 .

[83]  Twan Dollevoet,et al.  Robust UAV mission planning , 2011, Ann. Oper. Res..

[84]  Herbert Peremans,et al.  A network-consistent time-dependent travel time layer for routing optimization problems , 2013, Eur. J. Oper. Res..

[85]  Timothy L. Urban,et al.  Vehicle routing with soft time windows and Erlang travel times , 2008, J. Oper. Res. Soc..

[86]  Eiichi Taniguchi,et al.  Travel Time Reliability in Vehicle Routing and Scheduling with Time Windows , 2006 .

[87]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[88]  Tom Van Woensel,et al.  Vehicle routing problem with stochastic travel times including soft time windows and service costs , 2013, Comput. Oper. Res..

[89]  Richard W. Eglese,et al.  Vehicle routing and scheduling with time-varying data: A case study , 2010, J. Oper. Res. Soc..

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

[91]  Jeffry Setyawan Pribadi,et al.  Solving the Team Orienteering Problem with Particle Swarm Optimization , 2013 .

[92]  Byung-In Kim,et al.  A Branch-and-Price Approach for the Team Orienteering Problem with Time Windows , 2015 .

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

[94]  Dirk Cattrysse,et al.  A variable neighborhood search method for the orienteering problem with hotel selection , 2013 .

[95]  R. Noland,et al.  Travel time variability: A review of theoretical and empirical issues , 2002 .

[96]  Natarajan Gautam,et al.  Deriving Link Travel - Time Distributions via Stochastic Speed Processes , 2004, Transp. Sci..

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

[98]  Andrew L. Johnson,et al.  An augmented large neighborhood search method for solving the team orienteering problem , 2013, Expert Syst. Appl..

[99]  Teodor Gabriel Crainic,et al.  A tabu search for Time-dependent Multi-zone Multi-trip Vehicle Routing Problem with Time Windows , 2013, Eur. J. Oper. Res..

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

[101]  Elias W. Hans,et al.  A dynamic programming heuristic for vehicle routing with time-dependent travel times and required breaks , 2010 .

[102]  H. Karimi,et al.  A time-dependent vehicle routing problem in multigraph with FIFO property , 2015 .

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

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

[105]  R. Ravi,et al.  The Directed Orienteering Problem , 2011, Algorithmica.

[106]  David E. Boyce,et al.  Field Test of a Method for Finding Consistent Route Flows and Multiple-Class Link Flows in Road Traffic Assignments , 2010 .

[107]  S. Morito,et al.  AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM , 1988 .

[108]  Brian T. Denton,et al.  Operations research models and methods in the screening, detection, and treatment of prostate cancer: A categorized, annotated review , 2016 .

[109]  Michel Gendreau,et al.  Time-dependent routing problems: A review , 2015, Comput. Oper. Res..

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

[111]  Ram Ramesh,et al.  An efficient four-phase heuristic for the generalized orienteering problem , 1991, Comput. Oper. Res..

[112]  Giri Narasimhan,et al.  Resource-constrained geometric network optimization , 1998, SCG '98.

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

[114]  Piet Demeester,et al.  Dynamic and stochastic routing for multimodal transportation systems , 2014 .

[115]  R. Montemanni,et al.  Objective function evaluation methods for the orienteering problem with stochastic travel and service times , 2014 .

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

[117]  Miguel A. Figliozzi,et al.  The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics , 2012 .

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

[119]  Ana Isabel Barros,et al.  THE STOCHASTIC SCOUTING PROBLEM , 2012 .

[120]  Kitae Kim,et al.  Evaluation of floating car technologies for travel time estimation , 2012 .

[121]  Tom Van Woensel,et al.  The time-dependent vehicle routing problem with soft time windows and stochastic travel times , 2014 .

[122]  Gilbert Laporte,et al.  The selective travelling salesman problem , 1990, Discret. Appl. Math..

[123]  Chandra Chekuri,et al.  Improved algorithms for orienteering and related problems , 2008, SODA '08.

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

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

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

[127]  Mark S. Daskin,et al.  The orienteering problem with stochastic profits , 2008 .

[128]  Gilbert Laporte,et al.  The time-dependent pollution-routing problem , 2013 .

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

[130]  Andrés L. Medaglia,et al.  Solving the Orienteering Problem with Time Windows via the Pulse Framework , 2015, Comput. Oper. Res..

[131]  Dirk Cattrysse,et al.  A memetic algorithm for the orienteering problem with hotel selection , 2014, Eur. J. Oper. Res..

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

[133]  Michel Gendreau,et al.  A tabu search heuristic for the undirected selective travelling salesman problem , 1998, Eur. J. Oper. Res..

[134]  Nikolaos Geroliminis,et al.  Experienced travel time prediction for congested freeways , 2013 .

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

[136]  S. Balseiro,et al.  An Ant Colony heuristic for the Time Dependent Vehicle Routing Problem with Time Windows , 2008 .

[137]  Alain Hertz,et al.  The capacitated team orienteering and profitable tour problems , 2007, J. Oper. Res. Soc..

[138]  Charalampos Konstantopoulos,et al.  A survey on algorithmic approaches for solving tourist trip design problems , 2014, Journal of Heuristics.

[139]  David R. Karger,et al.  Approximation algorithms for orienteering and discounted-reward TSP , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[140]  Dirk Van Oudheusden,et al.  The planning of cycle trips in the province of East Flanders , 2011 .

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

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

[143]  Erik Jenelius,et al.  Non-parametric estimation of route travel time distributions from low-frequency floating car data , 2015 .

[144]  André Langevin,et al.  The multi-district team orienteering problem , 2014, Comput. Oper. Res..

[145]  Abraham Duarte,et al.  GRASP with path relinking for the orienteering problem , 2014, J. Oper. Res. Soc..

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

[147]  Hoong Chuin Lau,et al.  Dynamic Stochastic Orienteering Problems for Risk-Aware Applications , 2012, UAI.

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

[149]  M. F. Tasgetiren,et al.  A Genetic Algorithm with an Adaptive Penalty Function for the Orienteering Problem , 2005 .