Vehicle Routing and Staffing for Sedan Service

We present the optimization component of a decision support system developed for a sedan service provider. The system assists supervisors and dispatchers in scheduling driver shifts and routing the fleet throughout the day to satisfy customer demands within tight time windows. We periodically take a snapshot of the dynamic data and formulate an integer program, which we solve to near optimality using column generation. Although the data snapshot is stale by the time a solution is computed, we are able to solve the integer program quickly enough that the solution can be adopted after minor modifications are made by a fast local-search heuristic. The system described in this paper is currently in use and has improved the provider's productivity significantly.

[1]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[2]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

[3]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[4]  Anthony Wren,et al.  Computer Scheduling of Public Transportation: Urban Passenger Vehicle and Crew Scheduling , 1981 .

[5]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[6]  Jacques Desrosiers,et al.  Routing with time windows by column generation , 1983, Networks.

[7]  Marius M. Solomon,et al.  On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints , 1986, Networks.

[8]  J. Desrosiers,et al.  Time Window Constrained Routing and Scheduling Problems: a Survey , 1987 .

[9]  J. L. Nazareth.  Computer solution of linear programs , 1987 .

[10]  Jacques Desrosiers,et al.  Survey Paper - Time Window Constrained Routing and Scheduling Problems , 1988, Transp. Sci..

[11]  Jacques Desrosiers,et al.  Time Constrained Routing and Scheduling , 1992 .

[12]  Jacques Desrosiers,et al.  Chapter 2 Time constrained routing and scheduling , 1995 .

[13]  David Simchi-Levi,et al.  On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows , 1997, Oper. Res..

[14]  George L. Nemhauser,et al.  Flight String Models for Aircraft Fleeting and Routing , 1998, Transp. Sci..

[15]  Francisco Barahona,et al.  Plant location with minimum inventory , 1998, Math. Program..

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

[17]  Cynthia Barnhart,et al.  Airline Fleet Assignment with Time Windows , 2000, Transp. Sci..

[18]  François Soumis,et al.  An Optimization Model for the Simultaneous Operational Flight and Pilot Scheduling Problem , 2001, Manag. Sci..

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

[20]  Francisco Barahona,et al.  On some difficult linear programs coming from set partitioning , 2002, Discret. Appl. Math..

[21]  Jacques Desrosiers,et al.  Selected Topics in Column Generation , 2002, Oper. Res..