The Relationship between Vehicle Routing & Scheduling and Green Logistics - A Literature Survey

The basic Vehicle Routing and Scheduling Problem (VRSP) is described followed by an outline of solution approaches. Different variations of the basic VRSP are examined that involve the consideration of additional constraints or other changes in the structure of the appropriate model. An introduction is provided to Green Logistics issues that are relevant to vehicle routing and scheduling including discussion of the environmental objectives that should be considered. Particular consideration is given to VRSP models that relate to environmental issues including the timedependent VRSP, the transportation of hazardous materials and dynamic VRSP models. Finally some conclusions are drawn about further research needs in this area and the relation to road pricing.

[1]  Chelsea C. White,et al.  HAZMAT Transportation and Security: Survey and Directions for Future Research , 2002 .

[2]  Ulrich Derigs,et al.  A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints , 1992 .

[3]  Gilbert Laporte,et al.  Classical Heuristics for the Capacitated VRP , 2002, The Vehicle Routing Problem.

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

[5]  Michel Gendreau,et al.  DYNAMIC VEHICLE ROUTING AND DISPATCHING , 1998 .

[6]  G. Laporte,et al.  Exact Algorithms for the Vehicle Routing Problem , 1987 .

[7]  Olli Bräysy Fast Local Searches For The Vehicle Routing Problem With Time Windows , 2002 .

[8]  George M. Giaglis,et al.  Urban dynamic real-time distribution services: Insights from SMEs , 2006, J. Enterp. Inf. Manag..

[9]  Roberto Montemanni,et al.  Ant Colony System for a Dynamic Vehicle Routing Problem , 2005, J. Comb. Optim..

[10]  Awi Federgruen,et al.  One warehouse multiple retailer systems with vehicle routing costs , 1990 .

[11]  A. H. Robertson European Conference of Ministers of Transport , 1976 .

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

[13]  Michel Gendreau,et al.  Metaheuristics for the Capacitated VRP , 2002, The Vehicle Routing Problem.

[14]  Konstantinos G. Zografos,et al.  Multi‐Objective Programming Approach for Routing Hazardous Materials , 1989 .

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

[16]  Will Maden,et al.  A Road TimetableTM to aid vehicle routing and scheduling , 2006, Comput. Oper. Res..

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

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

[19]  Jeremy Shires,et al.  SURFACE TRANSPORT COSTS AND CHARGES - GREAT BRITAIN 1998 , 2001 .

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

[21]  Kamlesh Mathur,et al.  Stochastic Vehicle Routing Problem with Restocking , 2000, Transp. Sci..

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

[23]  Liping Fu,et al.  Estimation of time‐dependent, stochastic route travel times using artificial neural networks , 2000 .

[24]  Matthew Barth,et al.  Development and Application of an International Vehicle Emissions Model , 2005 .

[25]  Nicola Secomandi,et al.  A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands , 2001, Oper. Res..

[26]  Adam N. Letchford,et al.  A new branch-and-cut algorithm for the capacitated vehicle routing problem , 2004, Math. Program..

[27]  M. Dror Arc Routing : Theory, Solutions and Applications , 2000 .

[28]  Roberto Montemanni,et al.  Time Dependent Vehicle Routing Problem with an Ant Colony System , 2003 .

[29]  Erhan Erkut,et al.  Transport risk models for hazardous materials: revisited , 2005, Oper. Res. Lett..

[30]  Gilbert Laporte,et al.  Optimal Routing under Capacity and Distance Restrictions , 1985, Oper. Res..

[31]  Andrew Lim,et al.  A tabu search algorithm for the safe transportation of hazardous materials , 2005, SAC '05.

[32]  Roberto Baldacci,et al.  The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem , 2006, Comput. Oper. Res..

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

[34]  M. Mourgaya,et al.  The periodic Vehicle routing problem: classification and heuristic , 2006, RAIRO Oper. Res..

[35]  Jean-Yves Potvin,et al.  A parallel route building algorithm for the vehicle routing and scheduling problem with time windows , 1993 .

[36]  S Bonvicini,et al.  Hazardous materials transportation: a risk-analysis-based routing methodology. , 2000, Journal of hazardous materials.

[37]  Jorge Pinho de Sousa,et al.  Dynamic VRP in pharmaceutical distribution—a case study , 2006, Central Eur. J. Oper. Res..

[38]  José Brandão,et al.  A tabu search algorithm for the open vehicle routing problem , 2004, Eur. J. Oper. Res..

[39]  Richard W. Eglese,et al.  A new tabu search heuristic for the open vehicle routing problem , 2005, J. Oper. Res. Soc..

[40]  Vedat Verter,et al.  Designing a Road Network for Hazardous Materials Transportation , 2004, Transp. Sci..

[41]  Hoong Chuin Lau,et al.  Vehicle routing problem with time windows and a limited number of vehicles , 2003, Eur. J. Oper. Res..

[42]  Yehuda Bassok,et al.  Direct shipping and the dynamic single-depot/multi-retailer inventory system , 1997 .

[43]  Harvey M. Salkin,et al.  A set-partitioning-based exact algorithm for the vehicle routing problem , 1989, Networks.

[44]  Bruce L. Golden,et al.  VEHICLE ROUTING WITH BACKHAULS: MODELS, ALGORITHMS, AND CASE STUDIES. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1988 .

[45]  Adam N. Letchford,et al.  A branch-and-cut algorithm for the capacitated open vehicle routing problem , 2007, J. Oper. Res. Soc..

[46]  Vedat Verter,et al.  Modeling of Transport Risk for Hazardous Materials , 1998, Oper. Res..

[47]  Leonora Bianchi Notes on dynamic vehicle routing - the state of the art - , 2000 .

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

[49]  Michel Gendreau,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

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

[51]  Cristina Pronello,et al.  Pollutant emissions estimation in road transport models , 2000 .

[52]  J. Papastavrou A stochastic and dynamic routing policy using branching processes with state dependent immigration , 1996 .

[53]  Alexander H. G. Rinnooy Kan,et al.  Vehicle Routing with Time Windows , 1987, Oper. Res..

[54]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .

[55]  Gilbert Laporte,et al.  Tabu Search Heuristics for the Vehicle Routing Problem , 2005 .

[56]  P. K. Bagchi,et al.  Dynamic Vehicle Scheduling: An Expert Systems Approach , 1991 .

[57]  Jesper Larsen,et al.  Lagrangean duality applied on vehicle routing with time windows , 2001 .

[58]  T. B. Boffey,et al.  Optimal location of routes for vehicles transporting hazardous materials , 1995 .

[59]  Mark A. Turnquist,et al.  Modeling and Analysis for Hazardous Materials Transportation: Risk Analysis, Routing/Scheduling and Facility Location , 1991, Transp. Sci..

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

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

[62]  Moses Charikar,et al.  The finite capacity dial-a-ride problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[63]  Teodor Gabriel Crainic,et al.  Fleet management and logistics , 1998 .

[64]  Bruce L. Golden,et al.  Stochastic vehicle routing: A comprehensive approach , 1983 .