Chapter 7 Transportation on Demand

Publisher Summary Transportation on Demand (TOD) is concerned with the transportation of passengers or goods between specific origins and destinations at the request of users. In recent years, TOD systems have become increasingly popular for a number of reasons. With the aging of the population and the trend toward the development of ambulatory health care services, more and more people rely on door-to-door transportation systems provided by local authorities. Aircraft sharing has also gained in popularity because of the cost reduction efforts made by organizations and the numerous problems that have recently plagued the airline industry. A growing emphasis on electronic commerce, cycle-time compression, and just-in-time deliveries has increased the need for demand-responsive freight transportation systems. TOD systems can be either static or dynamic. In the first case, all requests are known beforehand, while in the second case, requests are received dynamically and vehicle routes must be adjusted in real-time to meet demand. Most TOD problems are characterized by the presence of three often conflicting objectives: maximizing the number of requests served, minimizing operating costs, and minimizing user inconvenience.

[1]  Gilbert Laporte,et al.  Perturbation heuristics for the pickup and delivery traveling salesman problem , 2002, Comput. Oper. Res..

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

[3]  L. Bianco,et al.  Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming , 1994 .

[4]  Jacques Renaud,et al.  A heuristic for the pickup and delivery traveling salesman problem , 2000, Comput. Oper. Res..

[5]  Martin Grötschel,et al.  Telebus Berlin: Vehicle Scheduling in a Dial-a-Ride System , 1999 .

[6]  Paolo Toth,et al.  Heuristic Algorithms for the Handicapped Persons Transportation Problem , 1997, Transp. Sci..

[7]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem , 2002 .

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

[9]  Jason D. Papastavrou,et al.  A stochastic and dynamic model for the single-vehicle pick-up and delivery problem , 1999, Eur. J. Oper. Res..

[10]  M. Savelsbergh An efficient implementation of local search algorithms for constrained routing problems , 1990 .

[11]  Jean-Yves Potvin,et al.  A computer assistant for vehicle dispatching with learning capabilities , 1995, Ann. Oper. Res..

[12]  J. P. Kelly,et al.  Meta-heuristics : theory & applications , 1996 .

[13]  Arthur V. Hill,et al.  An algorithm for the traveling salesman problem with pickup and delivery customers , 1985 .

[14]  H. Kunzi,et al.  Lectu re Notes in Economics and Mathematical Systems , 1975 .

[15]  Egon Balas,et al.  The precedence-constrained asymmetric traveling salesman polytope , 1995, Math. Program..

[16]  Jean-François Cordeau,et al.  A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..

[17]  Martin W. P. Savelsbergh,et al.  Decision Support for Consumer Direct Grocery Initiatives , 2005, Transp. Sci..

[18]  Jacques Desrosiers,et al.  A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows , 1984 .

[19]  Gilbert Laporte,et al.  Waiting strategies for the dynamic pickup and delivery problem with time windows , 2004 .

[20]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[21]  Richard L. Church,et al.  The Team/Fleet Models for Simultaneous Facility and Equipment Siting , 1979 .

[22]  Attahiru Sule Alfa,et al.  SCHEDULING OF VEHICLES FOR TRANSPORTATION OF ELDERLY , 1986 .

[23]  Vladimir Marianov,et al.  Siting Emergency Services , 1995 .

[24]  Harilaos N. Psaraftis,et al.  k-Interchange procedures for local search in a precedence-constrained routing problem , 1983 .

[25]  Jacques Desrosiers,et al.  Technical Note - Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs , 1989, Transp. Sci..

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

[27]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

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

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

[30]  Daniele Vigo,et al.  Heuristics for the traveling salesman problem with pickup and delivery , 1999, Comput. Oper. Res..

[31]  Thomas Francis Adams Police Field Operations , 1985 .

[32]  Mark S. Daskin,et al.  A Maximum Expected Covering Location Model: Formulation, Properties and Heuristic Solution , 1983 .

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

[34]  Jacques Desrosiers,et al.  An Algorithm for Mini-Clustering in Handicapped Transport , 1991 .

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

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

[37]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[38]  Lawrence Bodin,et al.  Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling , 1985, Transp. Sci..

[39]  Oli B. G. Madsen,et al.  A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives , 1995, Ann. Oper. Res..

[40]  Catherine Roucairol,et al.  A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem , 1996 .

[41]  C. Revelle,et al.  The queuing probabilistic location set covering problem and some extensions , 1994 .

[42]  Jacques Desrosiers,et al.  A Request Clustering Algorithm for Door-to-Door Handicapped Transportation , 1991, Transp. Sci..

[43]  H. Psaraftis An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows , 1983 .

[44]  Jacques Desrosiers,et al.  VRP with Pickup and Delivery , 2000, The Vehicle Routing Problem.

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

[46]  Nigel H. M. Wilson,et al.  A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows , 1986 .

[47]  Charles S. ReVelle,et al.  The Location of Emergency Service Facilities , 1971, Oper. Res..

[48]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[49]  Hoong Chuin Lau,et al.  Pickup and Delivery with Time Windows: Algorithms and Test Case Generation , 2002, Int. J. Artif. Intell. Tools.

[50]  Jacques Desrosiers,et al.  The Pickup and Delivery Problem with Time Windows , 1989 .

[51]  Charles S. ReVelle,et al.  The Maximum Availability Location Problem , 1989, Transp. Sci..

[52]  Jacques Desrosiers,et al.  Large Scale Multi-Vehicle Dial-a-Ride Problems , 1989 .

[53]  Rajan Batta,et al.  The Maximal Expected Covering Location Problem: Revisited , 1989, Transp. Sci..

[54]  Paolo Toth,et al.  Fast Local Search Algorithms for the Handicapped Persons Transportation Problem , 1996 .

[55]  Gilbert Laporte,et al.  Solving an ambulance location model by tabu search , 1997 .

[56]  Nicos Christofides Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

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

[58]  John J. Bernardo,et al.  Developing and validating a decision support system for locating emergency medical vehicles in Louisville, Kentucky , 1994 .

[59]  Richard L. Church,et al.  The maximal covering location problem , 1974 .

[60]  Jean-Yves Potvin,et al.  GENETIC ALGORITHMS FOR VEHICLE DISPATCHING , 1997 .

[61]  J. Wesley Barnes,et al.  Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search Transportation , 2000 .

[62]  RICHARD C. LARSON,et al.  A hypercube queuing model for facility location and redistricting in urban emergency services , 1974, Comput. Oper. Res..

[63]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[64]  Harilaos N. Psaraftis Analysis of an O(N2) heuristic for the single vehicle many-to-many Euclidean dial-a-ride problem , 1983 .

[65]  Kapil Kumar Gupta,et al.  Ambulance deployment analysis: A case study of Bangkok , 1987 .

[66]  Geoffrey E. Hinton,et al.  Learning internal representations by error propagation , 1986 .

[67]  Fred W. Glover,et al.  Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems , 1996, Discret. Appl. Math..

[68]  Jean-Yves Potvin,et al.  Decision support for vehicle dispatching using genetic programming , 1998, IEEE Trans. Syst. Man Cybern. Part A.

[69]  Michel Gendreau,et al.  A dynamic model and parallel tabu search heuristic for real-time ambulance relocation , 2001, Parallel Comput..

[70]  Walter Ukovich,et al.  A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem , 2006, Eur. J. Oper. Res..

[71]  Robert Dietrich,et al.  Validating and applying a model for locating emergency medical vehicles in Tuczon, AZ , 1990 .

[72]  Jan Karel Lenstra,et al.  Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows , 1993, Transp. Sci..

[73]  P. Healy,et al.  A new extension of local search applied to the Dial-A-Ride Problem , 1995 .

[74]  Philipp Slusallek,et al.  Introduction to real-time ray tracing , 2005, SIGGRAPH Courses.

[75]  H. D. Ratliff,et al.  Set partitioning based heuristics for interactive routing , 1981, Networks.

[76]  Matteo Fischetti,et al.  An Additive Bounding Procedure for Combinatorial Optimization Problems , 1989, Oper. Res..

[77]  K. Ruland,et al.  The pickup and delivery problem: Faces and branch-and-cut algorithm , 1997 .

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

[79]  Zhi-Long Chen,et al.  Solving a Practical Pickup and Delivery Problem , 2003, Transp. Sci..

[80]  Robert B. Dial,et al.  Autonomous dial-a-ride transit introductory overview , 1995 .

[81]  Gilbert Laporte,et al.  Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem , 2004, Parallel Comput..

[82]  Harilaos N. Psaraftis,et al.  A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem , 1980 .

[83]  Richard C. Larson,et al.  Urban Police Patrol Analysis , 1972 .

[84]  David M. Stein,et al.  Scheduling Dial-a-Ride Transportation Systems , 1978 .

[85]  Marvin B. Mandell,et al.  Covering models for two-tiered emergency medical services systems , 1998 .

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

[87]  Gilbert Laporte,et al.  A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem , 1996, INFORMS J. Comput..

[88]  Juan José Salazar González,et al.  A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery , 2004, Discret. Appl. Math..

[89]  Martin W. P. Savelsbergh,et al.  Incentive Schemes for Attended Home Delivery Services , 2006, Transp. Sci..

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

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

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

[93]  Charles ReVelle,et al.  Concepts and applications of backup coverage , 1986 .

[94]  Martin W. P. Savelsbergh,et al.  Local search in routing problems with time windows , 1984 .

[95]  Michael O. Ball,et al.  A Reliability Model Applied to Emergency Service Vehicle Location , 1993, Oper. Res..

[96]  Mark S. Daskin,et al.  A Hierarchical Objective Set Covering Model for Emergency Medical Service Vehicle Deployment , 1981 .

[97]  Dusan Teodorovic,et al.  A fuzzy logic approach to dynamic Dial-A-Ride problem , 2000, Fuzzy Sets Syst..

[98]  Liping Fu,et al.  Scheduling dial-a-ride paratransit under time-varying, stochastic congestion , 2002 .

[99]  Roberto Baldacci,et al.  An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections , 2003, Networks.

[100]  Martin W. P. Savelsbergh,et al.  Efficient feasibility testing for dial-a-ride problems , 2002, Oper. Res. Lett..