Introduction to Tour Planning: Vehicle Routing and Related Problems

In this chapter, we discuss different characteristics and variants of routing problems. First, an introduction to classic static routing problems is given. Since RDOPG applications can be modeled as a variant of the dynamic vehicle routing problem (DVRP) in which new requests dynamically arrive, variants of the VRP and the DVRP make up the main part of this chapter. Different classifications in the literature that deal with differences between static and dynamic routing problems are described. Since dynamic problems can be distinguished according to the type of relevant information revelation, appropriate existing classifications are also presented. In order to aggregate the results that are relevant for the considered RDOPG applications from these classifications, a unified approach for classifying routing problems is developed. According to this classification, different variants of VRPs which are known in the literature are introduced. In order to evaluate the performance of dynamic routing approaches, two different measures known in the literature are presented. Finally, a general classification scheme for characterizing routing problems is presented and extended with regard to additional characteristics which are relevant for RDOPG applications.

[1]  Michel Gendreau,et al.  Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography , 2008 .

[2]  Roberto Musmanno,et al.  Introduction to Logistics Systems Planning and Control (Wiley Interscience Series in Systems and Optimization) , 2004 .

[3]  Tong Sun,et al.  Algorithms for the vehicle routing problems with time deadlines , 1993 .

[4]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[5]  Gilbert Laporte,et al.  Chapter 7 Transportation on Demand , 2007, Transportation.

[6]  Saul I. Gass,et al.  Linear programming: methods and applications (5th ed.) , 1985 .

[7]  Broderick Crawford,et al.  Distributed Planning for the On-Line Dial-a-Ride Problem , 2007, FAW.

[8]  R. J. Dakin,et al.  A tree-search algorithm for mixed integer programming problems , 1965, Comput. J..

[9]  Jian Yang,et al.  Real-Time Multivehicle Truckload Pickup and Delivery Problems , 2004, Transp. Sci..

[10]  William J. Cook,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, 50 Years of Integer Programming.

[11]  Christelle Guéret,et al.  Dynamic Vehicle Routing Problems: State of the art and Prospects , 2011 .

[12]  Jörg P. Müller,et al.  COOPERATIVE TRANSPORTATION SCHEDULING : AN APPLICATION DOMAIN FOR DAI , 1996 .

[13]  Gilbert Laporte,et al.  The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms , 2003, 4OR.

[14]  Sven Oliver Krumke,et al.  Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows , 2002, ESA.

[15]  T. Bektaş.  The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .

[16]  Nicola Secomandi,et al.  Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands , 2000, Comput. Oper. Res..

[17]  Allan Larsen,et al.  The Dynamic Vehicle Routing Problem , 2000 .

[18]  Stefan Bock,et al.  Production , Manufacturing and Logistics Real-time control of freight forwarder transportation networks by integrating multimodal transport chains , 2009 .

[19]  Gilbert Laporte,et al.  An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands , 2002, Oper. Res..

[20]  Dimitris Bertsimas,et al.  A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane , 1991, Oper. Res..

[21]  Burak Eksioglu,et al.  The vehicle routing problem: A taxonomic review , 2009, Comput. Ind. Eng..

[22]  Cristián E. Cortés,et al.  Hybrid adaptive predictive control for a dynamic pickup and delivery problem including traffic congestion , 2008 .

[23]  M.E.T Horn,et al.  Multi-modal and demand-responsive passenger transport systems: a modelling framework with embedded control systems , 2002 .

[24]  Michel Gendreau,et al.  Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching , 2006, Transp. Sci..

[25]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[26]  Michel Gendreau,et al.  A PARALLEL TABU SEARCH HEURISTIC FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS , 1997 .

[27]  Michael Hülsmann,et al.  Collaborative Transportation Planning in Complex Adaptive Logistics Systems: A Complexity Science-Based Analysis of Decision-Making Problems of "Groupage Systems" , 2009, Complex.

[28]  Marius M. Solomon,et al.  Partially dynamic vehicle routing—models and algorithms , 2002, J. Oper. Res. Soc..

[29]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[30]  Richard W. Eglese,et al.  Disruption management of the vehicle routing problem with vehicle breakdown , 2011, J. Oper. Res. Soc..

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

[32]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..

[33]  Mwp Martin Savelsbergh,et al.  VEHICLE ROUTING WITH TIME WINDOWS: OPTIMIZATION AND APPROXIMATION. VEHICLE ROUTING: METHOD AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1987 .

[34]  Sven Oliver Krumke,et al.  Pruning in column generation for service vehicle dispatching , 2008, Ann. Oper. Res..

[35]  Gilbert Laporte,et al.  A Cutting Planes Algorithm for the m-Salesmen Problem , 1980 .

[36]  Russell Bent,et al.  Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers , 2004, Oper. Res..

[37]  Gilbert Laporte,et al.  Designing collection routes through bank branches , 1991, Comput. Oper. Res..

[38]  de We Willem Paepe,et al.  Complexity results and competitive analysis for vehicle routing problems , 2002 .

[39]  Jean-Paul Chilès,et al.  Wiley Series in Probability and Statistics , 2012 .

[40]  Gilbert Laporte,et al.  Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints , 1991, Oper. Res. Lett..

[41]  Eleni Hadjiconstantinou,et al.  Routing under Uncertainty: An Application in the Scheduling of Field Service Engineers , 2002, The Vehicle Routing Problem.

[42]  Jan Fabian Ehmke,et al.  Data chain management for planning in city logistics , 2009, Int. J. Data Min. Model. Manag..

[43]  Martin W. P. Savelsbergh,et al.  Competitive analysis of a dispatch policy for a dynamic multi-period routing problem , 2007, Oper. Res. Lett..

[44]  Jörn Schönberger,et al.  Adaptive demand peak management in online transport process planning , 2010, OR Spectr..

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

[46]  Gilbert Laporte,et al.  Ambulance location and relocation models , 2000, Eur. J. Oper. Res..

[47]  Jean-Yves Potvin,et al.  An Exchange Heuristic for Routeing Problems with Time Windows , 1995 .

[48]  André Langevin,et al.  Logistics systems : design and optimization , 2005 .

[49]  Gilbert Laporte,et al.  Some applications of the generalized vehicle routing problem , 2008, J. Oper. Res. Soc..

[50]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[51]  R. Bellman.  The theory of dynamic programming , 1954 .

[52]  Denis Borenstein,et al.  Real-time vehicle rerouting problems with time windows , 2009, Eur. J. Oper. Res..

[53]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[54]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[55]  Nasser A. El-Sherbeny,et al.  Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods , 2010 .

[56]  Elliott D. Kaplan.  Understanding GPS : principles and applications , 1996 .

[57]  Christos D. Tarantilis,et al.  Dynamic Vehicle Routing Problems , 2014, Vehicle Routing.

[58]  Bruce L. Golden,et al.  VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

[59]  Joris van de Klundert,et al.  ASAP: The After-Salesman Problem , 2010, Manuf. Serv. Oper. Manag..

[60]  Juan Melero,et al.  GSM, GPRS and EDGE Performance: Evolution Toward 3G/UMTS , 2002 .

[61]  Lawrence Bodin,et al.  Classification in vehicle routing and scheduling , 1981, Networks.

[62]  Gilbert Laporte,et al.  Arc Routing Problems, Part I: The Chinese Postman Problem , 1995, Oper. Res..

[63]  Jörg Homberger,et al.  A two-phase hybrid metaheuristic for the vehicle routing problem with time windows , 2005, Eur. J. Oper. Res..

[64]  Martin W. P. Savelsbergh,et al.  The General Pickup and Delivery Problem , 1995, Transp. Sci..

[65]  Dimitris Bertsimas,et al.  Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles , 1993, Oper. Res..

[66]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

[67]  Alan Mercer,et al.  A tabu search algorithm for the multi-trip vehicle routing and scheduling problem , 1997, Eur. J. Oper. Res..

[68]  Alexander Shapiro,et al.  The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study , 2003, Comput. Optim. Appl..

[69]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[70]  Teodor Gabriel Crainic,et al.  Chapter 8 Intermodal Transportation , 2007, Transportation.

[71]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[72]  Michel Gendreau,et al.  A tabu search heuristic for the heterogeneous fleet vehicle routing problem , 1999, Comput. Oper. Res..

[73]  Leon Sterling,et al.  A distributed agent approach to global transportation scheduling , 2003, IEEE/WIC International Conference on Intelligent Agent Technology, 2003. IAT 2003..

[74]  G. Laporte,et al.  Transportation Demand , 2019, Energy: Supply and Demand.

[75]  Nubia Velasco,et al.  Constructive Heuristics for the Multicompartment Vehicle Routing Problem with Stochastic Demands , 2008, Transp. Sci..

[76]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[77]  G. Laporte.  The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .

[78]  Moshe Dror,et al.  Vehicle routing with stochastic demands and restricted failures , 1992, ZOR Methods Model. Oper. Res..

[79]  Martin W. P. Savelsbergh,et al.  The Vehicle Routing Problem with Time Windows: Minimizing Route Duration , 1992, INFORMS J. Comput..

[80]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[81]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[82]  F. Tillman.  The Multiple Terminal Delivery Problem with Probabilistic Demands , 1969 .

[83]  Jacques Desrosiers,et al.  An Optimal Algorithm for the Traveling Salesman Problem with Time Windows , 1991, Oper. Res..

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

[85]  Gilbert Laporte,et al.  Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows , 2004 .

[86]  Melanie Mitchell,et al.  An introduction to genetic algorithms , 1996 .

[87]  Ali Haghani,et al.  Real-Time Emergency Response Fleet Deployment: Concepts, Systems, Simulation & Case Studies , 2007 .

[88]  Renato F. Werneck,et al.  Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem , 2006, Math. Program..

[89]  Harilaos N. Psaraftis,et al.  Dynamic vehicle routing: Status and prospects , 1995, Ann. Oper. Res..

[90]  Denis Borenstein,et al.  A Lagrangian Heuristic for the Real-Time Vehicle Rescheduling Problem , 2009 .

[91]  D. Bertsimas,et al.  Stochastic and dynamic vehicle routing with general demand and interarrival time distributions , 1993, Advances in Applied Probability.

[92]  D. Bartholomew,et al.  Linear Programming: Methods and Applications , 1970 .

[93]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[94]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[95]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

[96]  Martin W. P. Savelsbergh,et al.  Drive: Dynamic Routing of Independent Vehicles , 1998, Oper. Res..

[97]  Wolfgang Domschke,et al.  Rundreisen und Touren , 1985 .

[98]  Roberto Musmanno,et al.  Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies , 2003, Eur. J. Oper. Res..

[99]  David P. Morton,et al.  Stochastic Vehicle Routing with Random Travel Times , 2003, Transp. Sci..

[100]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[101]  Gilbert Laporte,et al.  The dial-a-ride problem: models and algorithms , 2006, Ann. Oper. Res..

[102]  Gilbert Laporte,et al.  The Vehicle Routing Problem with Stochastic Travel Times , 1992, Transp. Sci..

[103]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[104]  Moshe Dror,et al.  Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks , 1989, Transp. Sci..

[105]  Michel Gendreau,et al.  New Heuristics for the Vehicle Routing Problem , 2005 .

[106]  Thomas Stützle,et al.  Stochastic Local Search: Foundations & Applications , 2004 .

[107]  Christos D. Tarantilis,et al.  A flexible adaptive memory-based algorithm for real-life transportation operations: Two case studies from dairy and construction sector , 2007, Eur. J. Oper. Res..

[108]  Warren B. Powell,et al.  Stochastic and dynamic networks and routing , 1995 .

[109]  Gerhard Weiss,et al.  Multiagent systems: a modern approach to distributed artificial intelligence , 1999 .

[110]  Jaume Barceló,et al.  Traffic Data Collection and Its Standardization , 2010 .

[111]  Kutluhan Erol,et al.  In-Time Agent-Based Vehicle Routing with a Stochastic Improvement Heuristic , 1999, AAAI/IAAI.

[112]  Shi Ying,et al.  Frontiers in Algorithmics , 2010, Lecture Notes in Computer Science.

[113]  R. Bellman.  Dynamic programming. , 1957, Science.

[114]  Christos D. Tarantilis,et al.  Dynamic Fleet Management , 2007 .

[115]  Robert Goehlert,et al.  ECONOMIC DECISION MAKING. , 1981 .

[116]  Art Lew,et al.  Dynamic Programming: A Computational Tool , 2006 .

[117]  Javier Romero,et al.  GSM, Gprs and Edge Performance , 2003 .

[118]  Russell Bent,et al.  A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows , 2004, Transp. Sci..

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

[120]  Nicola Secomandi,et al.  Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands , 2009, Oper. Res..

[121]  Mark E. T. Horn,et al.  Fleet scheduling and dispatching for demand-responsive passenger services , 2002 .

[122]  Hanna Grzybowska,et al.  Vehicle Routing And Scheduling Models, Simulation And City Logistics , 2007 .

[123]  Roberto Musmanno,et al.  Introduction to Logistics Systems Planning and Control , 2004 .

[124]  Luc Muyldermans,et al.  On the benefits of co-collection: Experiments with a multi-compartment vehicle routing algorithm , 2010, Eur. J. Oper. Res..

[125]  Michel Gendreau,et al.  Neighborhood Search Heuristics for a Dynamic Vehicle Dispatching Problem with Pick-ups and Deliveries , 2006 .

[126]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[127]  J. K. Lenstra,et al.  Computational complexity of discrete optimization problems , 1977 .

[128]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[129]  Richard C. Larson,et al.  Urban Operations Research , 1981 .

[130]  Rajeev Raman,et al.  Algorithms — ESA 2002 , 2002, Lecture Notes in Computer Science.

[131]  Gilbert Laporte,et al.  A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems , 2007 .

[132]  Christos D. Tarantilis,et al.  Combination of geographical information system and efficient routing algorithms for real life distribution operations , 2004, Eur. J. Oper. Res..

[133]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

[134]  Bernhard Fleischmann,et al.  Dynamic Vehicle Routing Based on Online Traffic Information , 2004, Transp. Sci..

[135]  Daniele Vigo,et al.  Chapter 6 Vehicle Routing , 2007, Transportation.

[136]  Moshe Dror,et al.  Vehicle routing with stochastic demands: Models & computational methods , 2002 .

[137]  Antoine Jézéquel,et al.  Probabilistic vehicle routing problems , 1985 .

[138]  Gilbert Laporte,et al.  STOCHASTIC VEHICLE ROUTING. , 1996 .

[139]  Gilbert Laporte,et al.  Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic , 2006, Transp. Sci..

[140]  Andreas Richter.  Dynamische Tourenplanung - Modifikation von klassischen Heuristiken für das Dynamische Rundreiseproblem (DTSP) und das Dynamische Tourenplanungsproblem (DVRP) mit der Möglichkeit der Änderung des aktuellen Fahrzeugzuges , 2005 .

[141]  David S. Johnson,et al.  `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.

[142]  Jan Fabian Ehmke,et al.  Floating Car Data Based Analysis of Urban Travel Times for the Provision of Traffic Quality , 2010 .

[143]  Gianpaolo Ghiani,et al.  Real-Time Fleet Management At Ecourier Ltd , 2007 .

[144]  Jörn Schönberger,et al.  Supporting Cooperative Demand Fulfillment in Supply Networks Using Autonomous Control and Multi-Agent-Systems , 2009, GI Jahrestagung.

[145]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part II: Metaheuristics , 2005, Transp. Sci..

[146]  Jens Lysgaard,et al.  A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands , 2007, Oper. Res. Lett..

[147]  Marius M. Solomon,et al.  Classification Of Dynamic Vehicle Routing Systems , 2007 .

[148]  Patrick Weber,et al.  OpenStreetMap: User-Generated Street Maps , 2008, IEEE Pervasive Computing.