Territory Planning and Vehicle Dispatching with Driver Learning

This paper investigates the construction of routes for local delivery of packages. The primary objective of this research is to provide realistic models to optimize vehicle dispatching when customer locations and demands vary from day to day while maintaining driver familiarity with their service territories, hence dispatch consistency. The objective of increasing driver familiarity tends to make routes or service territories fixed. On the other hand, to serve varying demand it is advantageous to reassign vehicles/drivers and service territories each day. To balance the trade-offs between these two objectives, we developed the concepts of “cell,” “core area,” and “flex zone,” and created a two-stage vehicle routing model---strategic core area design and operational cell routing---and explicitly evaluated the effect of driver familiarity through the use of learning and forgetting curves.

[1]  Randolph W. Hall,et al.  Use of continuous approximations within discrete algorithms for routing vehicles: Experimental results and interpretation , 1994, Networks.

[2]  J. E. Beasley.  Fixed Routes , 1984 .

[3]  T. P. Wright,et al.  Factors affecting the cost of airplanes , 1936 .

[4]  Petros A. Ioannou,et al.  Truck route planning in nonstationary stochastic networks with time windows at customer locations , 2006, IEEE Transactions on Intelligent Transportation Systems.

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

[6]  Alan L. Erera,et al.  DESIGN OF LARGE-SCALE LOGISTICS SYSTEMS FOR UNCERTAIN ENVIRONMENTS , 2001 .

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

[8]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[9]  John E. Beasley,et al.  Vehicle routing using fixed delivery areas , 1984 .

[10]  Carlos F. Daganzo,et al.  The Distance Traveled to Visit N Points with a Maximum of C Stops per Vehicle: An Analytic Model and an Application , 1984, Transp. Sci..

[11]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[12]  Michael A. Haughton.  The performance of route modification and demand stabilization strategies in stochastic vehicle routing , 1998 .

[13]  C. Waters.  Vehicle-scheduling Problems with Uncertainty and Omitted Customers , 1989 .

[14]  Jürgen Branke,et al.  Waiting Strategies for Dynamic Vehicle Routing , 2005, Transp. Sci..

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

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

[17]  Carlos F. Daganzo,et al.  Design of multiple-vehicle delivery tours--I a ring-radial network , 1986 .

[18]  Alan J. Stenger,et al.  MODELING THE CUSTOMER SERVICE PERFORMANCE OF FIXED-ROUTES DELIVERY SYSTEMS UNDER STOCHASTIC DEMAND. , 1998 .

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

[20]  W. C. Benton,et al.  The vehicle scheduling problem with intermittent customer demands , 1992, Comput. Oper. Res..

[21]  Nicos Christofides.  Fixed routes and areas for delivery operations , 1971 .

[22]  M A Haughton.  Quantifying the benefits of route reoptimisation under stochastic customer demands , 2000, J. Oper. Res. Soc..

[23]  Nicos Christofides,et al.  Vehicle routing with a sparse feasibility graph , 1997 .

[24]  J. P. Kelly,et al.  Tabu search for the multilevel generalized assignment problem , 1995 .

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

[26]  Dimitris Bertsimas,et al.  A Vehicle Routing Problem with Stochastic Demand , 1992, Oper. Res..

[27]  Randolph W. Hall.  Pickup and Delivery Systems For Overnight Carriers , 1992 .

[28]  R. Leach.  The learning curve , 1992 .

[29]  Sanjeev R. Kulkarni,et al.  Combining cost-based and rule-based knowledge in complex resource allocation problems , 2006 .

[30]  David S. L. Wei,et al.  Computer Algorithms , 1998, Scalable Comput. Pract. Exp..

[31]  Salah E. Elmaghraby,et al.  Economic manufacturing quantities under conditions of learning and forgetting (EMQ/LaF) , 1990 .