A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems

Time constrained routing and scheduling is of significant importance across land, air and water transportation. These problems are also encountered in a variety of manufacturing, warehousing and service sector environments. Their mathematical complexity and the magnitude of the potential cost savings to be achieved by utilizing O.R. methodologies have attracted researchers since the early days of the field. Witness to this are the pioneering efforts of Dantzig and Fulkerson (1954), Ford and Fulkerson (1962), Appelgren (1969, 1971), Levin (1971), Madsen (1976) and Orloff (1976). Much of the methodology developed has made extensive use of network models and algorithms.

[1]  Celso C. Ribeiro,et al.  A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem , 1991, Oper. Res..

[2]  George L. Nemhauser,et al.  Solving binary cutting stock problems by column generation and branch-and-bound , 1994, Comput. Optim. Appl..

[3]  L. Appelgren.  Integer Programming Methods for a Vessel Scheduling Problem , 1971 .

[4]  Jacques Desrosiers,et al.  An Optimal Algorithm for the Traveling Salesman Problem with Time Windows , 1991, Oper. Res..

[5]  J. Desrosiers,et al.  Plus court chemin avec contraintes d'horaires , 1983 .

[6]  Moshe Dror,et al.  Savings by Split Delivery Routing , 1989, Transp. Sci..

[7]  François Soumis,et al.  A model for large-scale aircraft routing and scheduling problems , 1980 .

[8]  Pierre Hansen,et al.  Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem , 1991, Eur. J. Oper. Res..

[9]  Jacques Desrosiers,et al.  Daily Aircraft Routing and Scheduling , 1994 .

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

[11]  George B. Dantzig,et al.  Generalized Upper Bounding Techniques , 1967, J. Comput. Syst. Sci..

[12]  Sylvie Gélinas,et al.  Locomotive assignment with heterogeneous consists at CN North America , 1997 .

[13]  Martin Desrochers,et al.  Computer-Aided Transit Scheduling , 1992 .

[14]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[15]  Warren B. Powell,et al.  An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints , 1992, Transp. Sci..

[16]  D. R. Fulkerson,et al.  MINIMIZING THE NUMBER OF CARRIERS TO MEET A FIXED SCHEDULE , 1954 .

[17]  Richard D. McBride,et al.  Flight crew scheduling , 1993 .

[18]  Sylvie Gélinas,et al.  A new branching strategy for time constrained routing problems with application to backhauling , 1992, Ann. Oper. Res..

[19]  D. R. Fulkerson.  Flow Networks and Combinatorial Operations Research , 1966 .

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

[21]  Cynthia Barnhart,et al.  A column-generation technique for the long-haul crew-assignment problem , 1994 .

[22]  Martin Desrochers,et al.  CREW-OPT: Subproblem Modeling in a Column Generation Approach to Urban Crew Scheduling , 1992 .

[23]  Dag Wedelin,et al.  An algorithm for large scale 0–1 integer programming with application to airline crew scheduling , 1995, Ann. Oper. Res..

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

[25]  Jacques Desrosiers,et al.  A Column Generation Approach for Large-Scale Aircrew Rostering Problems , 1999, Oper. Res..

[26]  Jacques Desrosiers,et al.  Crew Pairing at Air France , 1993 .

[27]  J. Desrosiers,et al.  A dynamic programming algorithm for the shortest path problem with time windows and linear node costs , 1998 .

[28]  Jean-Philippe Vial,et al.  Shallow, deep and very deep cuts in the analytic center cutting plane method , 1999, Math. Program..

[29]  Leif H. Appelgren,et al.  A Column Generation Algorithm for a Ship Scheduling Problem , 1969 .

[30]  Marshall L. Fisher,et al.  Vehicle Routing with Time Windows: Two Optimization Algorithms , 1997, Oper. Res..

[31]  C. Ribeiro,et al.  An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment , 1989 .

[32]  Michel Gamache,et al.  A METHOD FOR OPTIMALLY SOLVING THE ROSTERING PROBLEM , 1993 .

[33]  J C Falkner,et al.  ASPECTS OF BUS CREW SCHEDULING USING A SET PARTITIONING MODEL. FROM THE BOOK COMPUTER-AIDED TRANSIT SCHEDULING , 1988 .

[34]  M. Desrochers,et al.  A reoptimization algorithm for the shortest path problem with time windows , 1988 .

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

[36]  Martin Desrochers,et al.  A Column Generation Approach to the Urban Transit Crew Scheduling Problem , 1987, Transp. Sci..

[37]  P. Wolfe.  A Technique for Resolving Degeneracy in Linear Programming , 1963 .

[38]  Jacques Desrosiers,et al.  2-Path Cuts for the Vehicle Routing Problem with Time Windows , 1997, Transp. Sci..

[39]  M. Minoux,et al.  A new approach for crew pairing problems by column generation with an application to air transportation , 1988 .

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

[41]  Thomas R. Sexton,et al.  Pickup and Delivery of Partial Loads with “Soft” Time Windows , 1986 .

[42]  Jacques Desrosiers,et al.  The Operational Airline Crew Scheduling Problem , 1997, Transp. Sci..

[43]  Lucio Bianco,et al.  Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints , 1997, Oper. Res..

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

[45]  Martin W. P. Savelsbergh,et al.  A Branch-and-Price Algorithm for the Generalized Assignment Problem , 1997, Oper. Res..

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

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

[48]  M. Padberg,et al.  Solving airline crew scheduling problems by branch-and-cut , 1993 .

[49]  Jacques Desrosiers,et al.  The Preferential Bidding System at Air Canada , 1997, Transp. Sci..

[50]  Lawrence Bodin,et al.  Classification in vehicle routing and scheduling , 1981, Networks.

[51]  Laurence A. Wolsey,et al.  An exact algorithm for IP column generation , 1994, Oper. Res. Lett..

[52]  Amos Levin.  Scheduling and Fleet Routing Models for Transportation Systems , 1971 .

[53]  José Pinto Paixão,et al.  A quasi-assignment algorithm for bus scheduling , 1987, Networks.

[54]  R Genser,et al.  Optimization Applied to Transportation Systems , 1977 .

[55]  Clifford S. Orloff,et al.  Route Constrained Fleet Scheduling , 1976 .

[56]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[57]  David M. Ryan,et al.  The Solution of Massive Generalized Set Partitioning Problems in Aircrew Rostering , 1992 .

[58]  Niklas Kohl,et al.  An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation , 1997, Oper. Res..

[59]  George L. Nemhauser,et al.  The fleet assignment problem: Solving a large-scale integer program , 1995, Math. Program..

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

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

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

[63]  Jan Karel Lenstra,et al.  A classification scheme for vehicle routing and scheduling problems , 1990 .

[64]  Jacques Desrosiers,et al.  Stabilisation dans le cadre de la génération de colonnes , 1997 .

[65]  Mwp Martin Savelsbergh,et al.  VEHICLE ROUTING WITH TIME WINDOWS: OPTIMIZATION AND APPROXIMATION. VEHICLE ROUTING: METHOD AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1987 .

[66]  Moshe Dror,et al.  Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW , 1994, Oper. Res..

[67]  L. Bodin.  ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

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

[69]  M M Etschmaier,et al.  AIRCRAFT SCHEDULING : THE STATE OF THE ART , 1984 .

[70]  George L. Nemhauser,et al.  Some properties of the fleet assignment problem , 1994, Oper. Res. Lett..

[71]  J. Ferland,et al.  Vehicles scheduling with sliding time windows , 1989 .

[72]  Dennis J. Sweeney,et al.  A Method of Decomposition for Integer Programs , 1979, Oper. Res..

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

[74]  Thomas L. Magnanti,et al.  Combinatorial optimization and vehicle fleet planning: Perspectives and prospects , 1981, Networks.

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

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

[77]  Cynthia Barnhart,et al.  Deadhead Selection for the Long-Haul Crew Pairing Problem , 1995, Oper. Res..

[78]  M. Desrochers,et al.  A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows , 1988 .

[79]  Jacek Gondzio,et al.  Solving nonlinear multicommodity flow problems by the analytic center cutting plane method , 1997, Math. Program..

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

[81]  André Langevin,et al.  A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows , 1990, Networks.

[82]  Marshall L. Fisher,et al.  Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees , 1994, Oper. Res..

[83]  Dennis F. X. Mathaisel,et al.  Airline Scheduling: An Overview , 1985, Transp. Sci..

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

[85]  Pierre Hansen,et al.  Un algorithme primal de programmation linéaire généralisée pour les programmes mixtes , 1991 .

[86]  Hokey Min,et al.  The multiple vehicle routing problem with simultaneous delivery and pick-up points , 1989 .

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

[88]  SGfren Holm,et al.  A unified approach for price directive decomposition procedures in integer programming , 1988, Discret. Appl. Math..

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

[90]  Giorgio Gallo,et al.  Network models for vehicle and crew scheduling , 1984 .

[91]  A. A. Farley.  A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems , 1990, Oper. Res..

[92]  Paolo Toth,et al.  State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

[93]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[94]  Edward K. Baker,et al.  Technical Note - An Exact Algorithm for the Time-Constrained Traveling Salesman Problem , 1983, Oper. Res..