DYNAMIC VEHICLE ROUTING AND DISPATCHING

Real-time decision problems are playing an increasingly important role in the economy due to advances in communication and information technologies that now allow realtime information to be quickly obtained and processed (Seguin et al., 1997). Among these, dynamic vehicle routing and dispatching problems have emerged as an intense area of research in the operations research community. Numerous examples may be found in Haines and Wolfe (1982), Powell, Jaillet and Odoni (1995) and Psaraftis (1995). In these problems, a set of vehicles is routed over a particular time horizon (typically, a day) while new service requests are occuring in real-time. With each new request, the current solution may be reconfigured to better service the new request, as well as those already assigned to a route.

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

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

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

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

[5]  I H Osman,et al.  Meta-Heuristics Theory and Applications , 2011 .

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

[7]  Paul M. Thompson,et al.  Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems , 1993, Oper. Res..

[8]  R Séguin,et al.  Real-time decision problems: an operational research perspective , 1997 .

[9]  George H. Haines,et al.  Alternative approaches to demand responsive scheduling algorithms , 1982 .

[10]  Warren B. Powell,et al.  A COMPARATIVE REVIEW OF ALTERNATIVE ALGORITHMS FOR THE DYNAMIC VEHICLE ALLOCATION PROBLEM , 1988 .

[11]  Gerald G. Brown,et al.  Consolidating and Dispatching Truck Shipments of Mobil Heavy Petroleum Products , 1995 .

[12]  Gerald G. Brown,et al.  Real-Time, Wide Area Dispatch of Mobil Tank Trucks , 1987 .

[13]  Moshe Dror,et al.  A computational comparison of algorithms for the inventory routing problem , 1985 .

[14]  Gerald G. Brown,et al.  Real-Time Dispatch of Petroleum Tank Trucks , 1981 .

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

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

[17]  D. Bertsimas,et al.  STOCHASTIC AND DYNAMIC VEHICLE ROUTING PROBLEM IN THE EUCLIDEAN PLANE WITH MULTIPLE CAPACITATED VEHICLES. , 1993 .

[18]  James L. McClelland,et al.  Parallel distributed processing: explorations in the microstructure of cognition, vol. 1: foundations , 1986 .

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

[20]  Oli B. G. Madsen,et al.  A heuristic method for dispatching repair men , 1995, Ann. Oper. Res..

[21]  Éric D. Taillard,et al.  Parallel iterative search methods for vehicle routing problems , 1993, Networks.

[22]  G. Kane.  Parallel Distributed Processing: Explorations in the Microstructure of Cognition, vol 1: Foundations, vol 2: Psychological and Biological Models , 1994 .

[23]  Michel Gendreau,et al.  Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching , 1999, Transp. Sci..

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

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

[26]  John R. Hauser,et al.  ADVANCED DIAL-A-RIDE ALGORITHMS RESEARCH PROJECT , 1976 .

[27]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

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

[29]  Moshe Dror,et al.  Stochastic and Dynamic Models in Transportation , 1993, Oper. Res..

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

[31]  Alan S. Minkoff.  A Markov Decision Model and Decomposition Heuristic for Dynamic Vehicle Dispatching , 1993, Oper. Res..

[32]  Oded Berman,et al.  Locating a Mobile Server Queueing Facility on a Tree Network , 1985 .

[33]  David Simchi-Levi,et al.  Analysis of vehicle routing and inventory-routing problems , 1995 .

[34]  Louis M. Dalberto,et al.  Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling Optimizer , 1983 .

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

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

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

[38]  S Roy.  ROUTING AND SCHEDULING OF TRANSPORTATION SERVICES FOR THE DISABLED: SUMMARY REPORT , 1984 .

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