Skip to main content
SpringerLink
Log in

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

  • Chapter
Fleet Management and Logistics

Part of the book series: Centre for Research on Transportation ((CRT))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Appelgren, L.H. (1969). A Column Generation Algorithm for a Ship Scheduling Problem. Transportation Science, 3:53–98.

    Article  Google Scholar 

  • Appelgren, L.H. (1971). Integer Programming Methods for a Vessel Scheduling Problem. Transportation Science, 5:64–78.

    Article  Google Scholar 

  • Baker, E. (1983). An Exact Algorithm for the Time Constrained Traveling Salesman Problem. Operations Research, 31:938–945.

    Article  Google Scholar 

  • Barnhart, C., C.A. Hane, E.L. Johnson and G. Sigismondi. (1991). An Alternative Formulation and Solution Strategy for Multi-Commodity Network Flow Problems. Report COC-9102, Georgia Institute of Technology, Atlanta, Georgia.

    Google Scholar 

  • Barnhart, C., L. Hatay, and E.L. Johnson. (1995). Deadhead Selection for the Long-Haul Crew Pairing Problem. Operations Research, 43:491–499.

    Article  Google Scholar 

  • Barnhart, C., E.L. Johnson, R. Anbil and L. Hatay. (1994a). A Column Generation Technique for the Long-Haul Crew Assignment Problem. In T.A. Ciriani and R. Leachman, editors, Mathematical Programming and Modeling Techniques in Practice, pages 7–22, Optimization in Industry 2. John Wiley and Sons, New-York.

    Google Scholar 

  • Barnhart, C., E.L. Johnson, G.L. Nemhauser and M.W.P. Savelsbergh. (1994b). Branch and Price: Column Generation for Solving Huge Integer Programs. Computational Optimization Center, COC-94-03, Georgia Institute of Technology, Atlanta.

    Google Scholar 

  • Bodin, L. and B. Golden. (1981). Classification in Vehicle Routing and Scheduling. Networks, 11:97–108.

    Article  Google Scholar 

  • Bodin, L., B. Golden, A. Assad and M. Ball. (1983). Routing and Scheduling of Vehicles and Crews: The State of the Art. Computers and Operations Research, 10:62–212.

    Google Scholar 

  • Bramel, J. and D. Simchi-Levi. (1997). On the Effectiveness of Set Coveringing Formulations for the Vehicle Routing Problem with Time Windows. Operations Research, 45:295–301.

    Article  Google Scholar 

  • Carraresi, P. and G. Gallo. (1984). Network Models for Vehicle and Crew Scheduling. European Journal of Operations Research, 16:139–151.

    Article  Google Scholar 

  • Christiansen, M. (1996). Inventory and Time Constrained Ship Routing — A Mathematical Approach. Ph.D. Dissertation, Norvegian University of Science and Technology, Trondheim, Norway.

    Google Scholar 

  • Christofides, N., A. Mingozzi, and P. Toth. (1981). Space-State Relaxation Procedures for the Computation of Bounds to Routing Problems. Networks, 11:145–164.

    Article  Google Scholar 

  • Daduna, J.R., I. Branco and J. Paixão. (eds.) (1995). Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems 430. Springer Verlag, Berlin.

    Google Scholar 

  • Dantzig, G. and D. Fulkerson. (1954). Minimizing the Numbers of Tankers to Meet a Fixed Schedule. Naval Research Logistics Quarterly, 1:217–222.

    Article  Google Scholar 

  • Dantzig, G.B. and R.M. Van Slyke. (1967). Generalized Upper Bounding Techniques. Journal of Computer and System Sciences, 1:213–226.

    Article  Google Scholar 

  • Dantzig, G.B. and P. Wolfe. (1960). Decomposition Principle for Linear Programs. Operations Research, 8:101–111.

    Article  Google Scholar 

  • Desaulniers, G., J. Desrosiers, Y. Dumas, S. Marc, B. Rioux, M.M. Solomon and F. Soumis. (1997a). Crew Pairing at Air France. European Journal of Operational Research, 97:245–259.

    Article  Google Scholar 

  • Desaulniers, G., J. Desrosiers, M.M. Solomon and F. Soumis. (1997b). Daily Aircraft Routing and Scheduling. Management Science, 43:841–855.

    Article  Google Scholar 

  • Desrochers, M. (1986). La fabrication d’horaires de travail pour les conducteurs d’autobus par une méthode de génération de colonnes. Université de Montréal, Centre de recherche sur les Transports, Publication #470. CP 6128, Succursale “Centreville”, Montréal, Québec, H3C 3J7. (In French)

    Google Scholar 

  • Desrochers, M., J. Desrosiers and M. Solomon. (1992). A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows. Operations Research, 40:342–354.

    Article  Google Scholar 

  • Desrochers, M., J. Gilbert, M. Sauvé and F. Soumis. (1992). CREW-OPT: Subproblem Modeling in a Column Generation Approach to Urban Crew Scheduling. In M. Desrochers and J.-M. Rousseau, editors, Computer-Aided Transit Scheduling, pages 395–406, Lecture Notes in Economics and Mathematical Systems 386. Springer Verlag, Berlin.

    Chapter  Google Scholar 

  • Desrochers, M., J.K. Lenstra and M.W.P. Savelsbergh. (1990). Classification of Vehicle Routing and Scheduling Problems. European Journal of Operational Research, 46:322–332.

    Article  Google Scholar 

  • Desrochers, M., J.K. Lenstra, M.W.P. Savelsbergh and F. Soumis. (1988). Vehicle Routing with Time Windows: Optimization and Approximation. In B. Golden and A.A. Assad, editors, Vehicle Routing: Methods and Studies, pages 65–84, North-Holland, Amsterdam.

    Google Scholar 

  • Desrochers, M. and J.-M. Rousseau (eds). (1992). Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems 386. Springer Verlag, Berlin.

    Google Scholar 

  • Desrochers, M. and F. Soumis. (1988a). A Generalized Permanent Labeling Algorithm for the Shortest Path Problem with Time Windows. INFOR, 26:191–212.

    Google Scholar 

  • Desrochers, M. and F. Soumis. (1988b). A Reoptimization Algorithm for the Shortest Path Problem with Time Windows. European Journal of Operational Research, 35:242–254.

    Article  Google Scholar 

  • Desrochers, M. and F. Soumis. (1989). A Column Generation Approach to the Urban Transit Crew Scheduling Problem. Transportation Science, 23:1–13.

    Article  Google Scholar 

  • Desrosiers, J., Y. Dumas, M.M. Solomon and F. Soumis. (1995). Time Constrained Routing and Scheduling. In M.O. Ball et al., editors, Network Routing, Handbooks in Operations Research and Management Science 8, pages 35–139, Elsevier Science, Amsterdam.

    Google Scholar 

  • Desrosiers, J., Y. Dumas and F. Soumis. (1986). A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-a-Ride Problem with Time Windows. The American Journal of Mathematical and Management Sciences, 6:301–325.

    Google Scholar 

  • Desrosiers, J., P. Hansen, B. Jaumard, F. Soumis and D. Villeneuve. (1994). Dantzig-Wolfe Decomposition and Column Generation for Linear and Nonlinear Integer Programs. Working paper. GERAD, École des HEC, Montréal, Canada, H3T 2A7.

    Google Scholar 

  • Desrosiers, J., P. Pelletier and F. Soumis. (1983). Plus court chemin avec contraintes d’horaires, RAIRO, 17:357–377, (in French).

    Google Scholar 

  • Desrosiers, J., F. Soumis and M. Desrochers. (1984). Routing with Time Windows by Column Generation. Networks, 14:545–565.

    Article  Google Scholar 

  • Dror, M. (1994). Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW. Operations Research, 42:977–978.

    Article  Google Scholar 

  • Dror, M. and P. Trudeau. (1989). Savings by Split Delivery Routing. Transportation Science, 23:141–145.

    Article  Google Scholar 

  • Dumas, Y., J. Desrosiers, E. Gélinas and M.M. Solomon. (1995). An Optimal Algorithm for the Traveling Salesman Problem with Time Windows. Operations Research, 43:367–371.

    Article  Google Scholar 

  • Dumas, Y., J. Desrosiers and F. Soumis. (1990). Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs. Transportation Science, 24:145–151.

    Article  Google Scholar 

  • Dumas, Y., J. Desrosiers and F. Soumis. (1991). The Pickup and Delivery Problem with Time Windows. European Journal of Operational Research, 54:7–22.

    Article  Google Scholar 

  • du Merle, O. (1995). Points intérieurs et plans coupants: Mise en oeuvre et développement d’une méthode pour l’optimisation convexe et la programmation linéaire structurée de grande taille. Ph.D. Dissertation, Université de Genève, Switzerland.

    Google Scholar 

  • du Merle, O., D. Villeneuve, J. Desrosiers and P. Hansen. (1997). Stabilisation dans le cadre de la génération de colonnes. Les Cahiers du GERAD, G-97-08, École des HEC, Montréal, Canada, H3T 2A7.

    Google Scholar 

  • Etschmaier, M.M. and D.F.X. Mathaisel. (1984). Aircraft Scheduling: The State of the Art. AGIFORS Proceedings XXIV, 181–225.

    Google Scholar 

  • Etschmaier, M.M. and D.F.X. Mathaisel. (1985). Airline Scheduling: An Overview. Transportation Science, 19:127–138.

    Article  Google Scholar 

  • Falkner, J.C. and D.M. Ryan. (1988). Aspects of Bus Crew Scheduling Using a Set Partitioning Model. In J.R. Daduna and A. Wren, editors, Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems 308, pages 91–103, Springer-Verlag, Berlin.

    Google Scholar 

  • Farley, A.A. (1990). A Note on Bounding a Class of Linear Programming Problems, includIncluding Cutting Stock Problems. Operations Research, 38:922–923.

    Article  Google Scholar 

  • Ferland, J.A. and L. Fortin. (1989). Vehicle Routing with Sliding Time-Windows. European Journal of Operational Research, 38:359–378.

    Article  Google Scholar 

  • Fischetti, M. and P. Toth. (1989). An Additive Bounding Procedure for Combinatorial Optimization Problems. Operations Research 37:319–328.

    Article  Google Scholar 

  • Fisher, M.L. (1994). Optimal Solution of Vehicle Routing Problems Using Minimum k-Trees. Operations Research, 42:626–642.

    Article  Google Scholar 

  • Fisher, M.L. (1995). Vehicle Routing. In M.O. Ball et al., editors, Network Routing, Handbooks in Operations Research and Management Science 8, pages 1–33, Elsevier Science, Amsterdam.

    Google Scholar 

  • Fisher, M.L., K.O. Jörnsten and O.B.G. Madsen. (1997). Vehicle Routing with Time Windows — Two Optimization Algorithms. Operations Research, 45:488–498.

    Article  Google Scholar 

  • Ford, L. and D.R. Fulkerson. (1962). Flows in Networks. Princeton University Press, Princeton, N.J.

    Google Scholar 

  • Fulkerson, D.R. (1972). Flow Networks and Combinatorial Operations Research. In A.M. Geoffrion, editor, Perspectives on Optimization, pages 139–171, Addison-Wesley, Reading, Mass.

    Google Scholar 

  • Gamache, M. and F. Soumis. (1997). A Method for Optimally Solving the Rostering Problem. In Gang Yu, editor, Operations Research in Airline Industry, pages 124–157, Kluwer Academic Publishers, Boston.

    Google Scholar 

  • Gamache, M., F. Soumis, G. Marquis and J. Desrosiers. (1998a). A Column Generation Approach for Large Scale Aircrew Rostering Problem. Operations Research. Forthcoming.

    Google Scholar 

  • Gamache, M., F. Soumis, D. Villeneuve, J. Desrosiers and E. Gélinas. (1998b). The Preferential Bidding System at Air Canada. Transportation Science. Forthcoming.

    Google Scholar 

  • Gélinas, S. (1990). Fabrication de tournées avec rechargement. Master Thesis, École Polytechnique de Montréal, Canada, (in French).

    Google Scholar 

  • Gélinas, S. (1998). Problèmes d’ordonnancement. Ph.D. Dissertation, École Polytechnique de Montréal, Canada. In preparation.

    Google Scholar 

  • Gélinas, S., M. Desrochers, J. Desrosiers and M.M. Solomon. (1995). A New Branching Strategy for Time Constrained Routing Problems with Application to Backhauling. Annals of Operations Research, 61:91–109.

    Article  Google Scholar 

  • Gélinas, S. and F. Soumis. (1998). A Dynamic Programming Algorithm for Single Machine Scheduling with Ready Times and Deadlines to Minimize Total Weighted Completion. MIS Collection in The Annals of Operations Research. Forthcoming.

    Google Scholar 

  • Geoffrion, A.M. (1974). Lagrangian Relaxation and its Uses in Linear Programming. Mathematical Programming Study, 2:82–112.

    Article  Google Scholar 

  • Gilmore, P.C. and R.E. Gomory. (1961). A Linear Programming Approach to the Cutting-Stock Problem. Operations Research, 9:849–859.

    Article  Google Scholar 

  • Goffin, J.-L., J. Gondzio, K. Sarkissian and J.-P. Vial. (1997). Solving Nonlinear Multicommodity Flow Problems by the Analytic Center Cutting Plane Method. Mathematical Programming, 76:131–154.

    Google Scholar 

  • Goffin, J.-L. and J.-P. Vial. (1996). Shallow, Deep and Very Deep Cuts in the Analytic Center Cutting Plane Method. Les Cahiers de GERAD, G-96-20, École des HEC, Montréal, Canada, H3T 2A7.

    Google Scholar 

  • Graves, G.W., R.D. McBride, I. Gershkoff, D. Anderson and D. Mahidhara. (1993). Flight Crew Scheduling. Management Science, 39:736–745.

    Article  Google Scholar 

  • Gu, Z., E.L. Johnson, G.L. Nemhauser and Y. Wang. (1994). Some Properties of the Fleet Assignment Problem. Operations Research Letters, 15:59–71.

    Article  Google Scholar 

  • Halse, K. (1992). Modeling and Solving Complex Vehicle Routing Problems. Ph.D. Dissertation no. 60, IMSOR, Technical University of Denmark, Lyngby.

    Google Scholar 

  • Hane, C., C. Barnhart, E.L. Johnson, R. Marsten, G.L. Nemhauser and G. Sigismondi. (1995). The Fleet Assignment Problem: Solving a Large-Scale Integer Program. Mathematical Programming, 70:211–232.

    Google Scholar 

  • Hansen, P., B. Jaumard, S. Krau and O. du Merle. (1998). An l 1-norm Bundle Method for the Multisource Weber Problem. Les Cahiers de GERAD, École des Hautes Études Commerciales, Montréal, Canada, H3T 2A7. (Forthcoming).

    Google Scholar 

  • Hansen, P., B. Jaumard and M. Poggi de Aragão. (1991). Un algorithme primal de programmation linéaire généralisée pour les programmes mixtes. Comptes Rendus de l’Académie des Sciences de Paris, 313:557–560. In French.

    Google Scholar 

  • Hansen, P., B. Jaumard and M. Poggi de Arragāo. (1992). Mixed Integer Column Generation and the Probabilistic Maximum Satisfiability Problem. Proceedings of IPCO2, Carnegie-Mellon University, Pittsburgh, 165–180.

    Google Scholar 

  • Hoffman, K.L. and M. Padberg. (1993). Solving Airline Crew Scheduling Problems by Branch-and-Cut. Management Science, 39:657–682.

    Article  Google Scholar 

  • Holm, S. and J. Tind. (1988). A Unified Approach for Price Directive Decomposition Procedures in Integer Programming. Discrete Applied Mathematics, 20:205–219.

    Article  Google Scholar 

  • Houck Jr., D.J., J-C. Picard, M. Queyranne and R.R. Vemuganti. (1980). The Traveling Salesman Problem as a Constrained Shortest Path Problem: Theory and Computational Experience. Opsearch, 17:93–109.

    Google Scholar 

  • Ioachim, I., J. Desrosiers, F. Soumis and N. Bélanger. (1994). Fleet Routing with Schedule Synchronization Constraints. Les Cahiers du GERAD, G-94-48, École des HEC, Montréal, Canada, H3T 2A7.

    Google Scholar 

  • Ioachim, L, S. Gélinas, J. Desrosiers and F. Soumis. (1998). A Dynamic Programming Algorithm for the Shortest Path Problem with Time Windows and Linear Node Costs. Networks. Forthcoming.

    Google Scholar 

  • Kohl, N. and O.B.G. Madsen. (1997). An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangean Relaxation. Operations Research, 45:395–406.

    Article  Google Scholar 

  • Kohl, N., J. Desrosiers, O.B.G. Madsen, M.M. Solomon and F. Soumis. (1998). 2-Path Cuts for the Vehicle Routing Problem with Time Windows. Transportation Science. Forthcoming.

    Google Scholar 

  • Kolen, A.W.J., A.H.G. Rinnooy Kan and H.W.J.M. Trienekens. (1987). Vehicle Routing with Time Windows. Operations Research, 35:266–273.

    Article  Google Scholar 

  • Kontoravdis, G. and J.F. Bard. (1992). Improved Heuristics for the Vehicle Routing Problem with Time Windows. Working paper. Department of Mechanical Engineering, The University of Texas, Austin, TX 78712-1063.

    Google Scholar 

  • Koskosidis, Y.A., W.B. Powell and M.M. Solomon. (1992). An Optimization Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints. Transportation Science, 26:69–85.

    Article  Google Scholar 

  • Langevin, A., M. Desrochers, J. Desrosiers and F. Soumis. (1993). A Two-Commodity Flow Formulation for the Traveling Salesman and Makespan Problems with Time Windows. Networks, 23:631–640.

    Article  Google Scholar 

  • Laporte, G. (1992). The Vehicle Routing Problem: An Overview of Exact and Approximate Algorithms. European Journal of Operational Research, 59:345–358.

    Article  Google Scholar 

  • Lasdon, L.S. (1970). Optimization Theory for Large Systems. Collier-MacMillan, New-York.

    Google Scholar 

  • Lavoie, S., M. Minoux and E. Odier. A New Approach of Crew Pairing Problems by Column Generation and Application to Air Transport. European Journal of Operational Research 35, 45–58, 1988.

    Article  Google Scholar 

  • Lemaréchal, C. (1989). Non Differentiable Optimization. In G.L. Nemhauser, A.G.H. Rinnooy Kan and M.J. Todol, editors, Optimization, Handbooks in Operations Research and Management Science 1, pages 529–572, Elsevier Science, Amsterdam.

    Google Scholar 

  • Levin, A. (1971). Scheduling and Fleet Routing Models for Transportations Systems. Transportation Science, 5:232–255.

    Article  Google Scholar 

  • Maculan, N., P. Michelon and G. Plateau. (1992). Column-Generation in Linear Programming with Bounding Variable Constraints and its Application in Integer Programming. Working Paper ES-268/92, Federal University of Rio de Janeiro, P.O. Box 68511, 21945 Rio de Janeiro, Brazil.

    Google Scholar 

  • Madsen, O.B.G. (1976). Optimal Scheduling of Trucks — A Routing Problem with Tight Due Times for Delivery. In H. Strobel, R. Genser and M. Etschmaier, editors, Optimization Applied to Transportation Systems, pages 126–136, International Institute for Applied System Analysis (HASA), CP-77-7, Laxenburgh, Austria.

    Google Scholar 

  • Magnanti, T. (1981). Combinatorial Optimization and Vehicle Fleet Planning: Perspectives and Prospects. Networks, 11:179–214.

    Article  Google Scholar 

  • Mehrorta, A. and M.A. Trick. (1993). A Column Generation Approach to Graph Coloring. Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh.

    Google Scholar 

  • Min, H. (1989). The Multiple Vehicle Routing Problem with Simultaneous Delivery and Pickup Points. Transportation Research, 23A:377–386.

    Article  Google Scholar 

  • Mingozzi, A., L. Bianco and S. Ricciardelli. (1997). Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints. Operations Research, 45:365–377.

    Article  Google Scholar 

  • Orloff, C. (1976). Route Constrained Fleet Scheduling. Transportation Science, 10:149–168.

    Article  Google Scholar 

  • Paixāo, J. and I.M. Branco. (1987). A Quasi-Assignment Algorithm for Bus Scheduling. Networks 17:249–

    Article  Google Scholar 

  • Psaraftis, H. (1980). A Dynamic Programming Solution to the Single-Vehicle, Many-to-Many, Immediate Request Dial-a-Ride Problem. Transportation Science, 14:130–154.

    Article  Google Scholar 

  • Psaraftis, H. (1983). An Exact Algorithm for the Single-Vehicle Many-to-Many Dial-a-Ride Problem with Time Windows. Transportation Science, 17:351–357.

    Article  Google Scholar 

  • Ribeiro, C., M. Minoux and C. Penna. (1989). An Optimal Column-Generation-with-Ranking Algorithm for Very Large Scale Set Partitioning Problems in Traffic Assignment. European Journal of Operational Research, 41:232–239.

    Article  Google Scholar 

  • Ribeiro, C. and F. Soumis. (1994). A Column Generation Approach to the Multiple Depot Vehicle Scheduling Problem. Operations Research, 42:41–52.

    Article  Google Scholar 

  • Ryan, D.M. and B.A. Forster. (1981). An Integer Programming Approach to Scheduling. In A. Wren, editor, Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, pages 269–280, North-Holland, Amsterdam.

    Google Scholar 

  • Ryan, D.M. (1992). The Solution of Massive Generalized Set Partitioning Problems in Air Crew Rostering. Journal of the Operational Research Society, 43:459–467.

    Google Scholar 

  • Savelsbergh, M.W.P. (1993). A Branch-and-Price Algorithm for the Generalized Assignment Problem. Computational Optimization Center COC-93-03, Georgia Institute of Technology, Atlanta, Georgia.

    Google Scholar 

  • Sexton, T. and L. Bodin. (1985). Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling. Transportation Science, 19:378–410.

    Article  Google Scholar 

  • Sexton, T. and Y. Choi. (1986). Pickup and Delivery of Partial Loads with Time Windows. American Journal of Mathematical and Management Sciences, 6:369–398.

    Article  Google Scholar 

  • Solomon M.M. and J. Desrosiers. (1988). Time Window Constrained Routing and Scheduling Problems. Transportation Science, 22:1–13.

    Article  Google Scholar 

  • Soumis, F., J. Ferland and J.-M. Rousseau. (1980). A Large Scale Model for Airline Fleet Planning and Scheduling Problem. Transportation Research, 14B:191–201.

    Article  Google Scholar 

  • Stojković, M., F. Soumis and J. Desrosiers. (1998). The Operational Airline Crew Scheduling Problem. Transportation Science. Forthcoming.

    Google Scholar 

  • Sweeney, D.J. and R.A. Murphy. (1979). A Method of Decomposition for Integer Programs. Operations Research, 27:1128–1141.

    Article  Google Scholar 

  • Vance, P.H., C. Barnhart, E.L. Johnson and G.L. Nemhauser. (1994). Solving Binary Cutting Stock Problems by Column Generation and Branch-and-Bound. Computational Optimization and Applications, 3:111–130.

    Article  Google Scholar 

  • Vanderbeck, F. and L.A. Wolsey. (1996). An Exact Algorithm for IP Column Generation. Operations Research Letters, 19:151–159.

    Article  Google Scholar 

  • Wedelin, D. (1995). An Algorithm for Large Scale 0-1 Integer Programming with Applications to Airline Crew Scheduling. Annals of Operations Research, 57:283–301.

    Article  Google Scholar 

  • Wolfe, P. (1963). A Technique for Resolving Degeneracy in Linear Programming. Journal of the Society for Industrial and Applied Mathematics, 11:205–211.

    Article  Google Scholar 

  • Ziarati, K., F. Soumis, J. Desrosiers, S. Gélinas and A. Saintonge. (1997). Locomotive Assignment with Heterogeneous Consists at CN North America. European Journal of Operational Research, 97:281–292.

    Article  Google Scholar 

Download references

Authors
  1. Guy Desaulniers
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jacques Desrosiers
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Irina loachim
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Marius M. Solomon
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. François Soumis
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Daniel Villeneuve
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Université du Québec à Montréal, Canada

    Teodor Gabriel Crainic

  2. École des Hautes Études Commerciales de Montréal, Canada

    Gilbert Laporte

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer Science+Business Media New York

About this chapter

Cite this chapter

Desaulniers, G., Desrosiers, J., loachim, I., Solomon, M.M., Soumis, F., Villeneuve, D. (1998). A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems. In: Crainic, T.G., Laporte, G. (eds) Fleet Management and Logistics. Centre for Research on Transportation. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5755-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-5755-5_3

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7637-8

  • Online ISBN: 978-1-4615-5755-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation