Skip to main content
SpringerLink
Log in

Joint Vehicle and Crew Routing and Scheduling

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming (CP 2015)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 9255))

Abstract

Traditional vehicle routing problems implicitly assume only one crew operates a vehicle for the entirety of its journey. However, this assumption is violated in many applications arising in humanitarian and military logistics. This paper considers a Joint Vehicle and Crew Routing and Scheduling Problem, in which crews are able to interchange vehicles, resulting in space and time interdependencies between vehicle routes and crew routes. It proposes a constraint programming model that overlays crew routing constraints over a standard vehicle routing problem. The constraint programming model uses a novel optimization constraint that detects infeasibility and bounds crew objectives. Experimental results demonstrate significant benefits of using constraint programming over mixed integer programming and a vehicle-then-crew sequential approach.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

  1. Bent, R., Van Hentenryck, P.: A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Science 38(4), 515–530 (2004)

    Article  Google Scholar 

  2. Berbeglia, G., Cordeau, J.F., Gribkovskaia, I., Laporte, G.: Static pickup and delivery problems: a classification scheme and survey. TOP 15(1), 1–31 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  3. Cordeau, J.F., Stojković, G., Soumis, F., Desrosiers, J.: Benders decomposition for simultaneous aircraft routing and crew scheduling. Transportation Science 35(4), 375–388 (2001)

    Article  MATH  Google Scholar 

  4. Drexl, M.: On some generalized routing problems. Ph.D. thesis, RWTH Aachen University, Aachen (2007)

    Google Scholar 

  5. Drexl, M.: Synchronization in vehicle routing–a survey of VRPs with multiple synchronization constraints. Transportation Science 46(3), 297–316 (2012)

    Article  Google Scholar 

  6. Drexl, M.: Applications of the vehicle routing problem with trailers and transshipments. European Journal of Operational Research 227(2), 275–283 (2013)

    Article  MathSciNet  Google Scholar 

  7. Drexl, M.: Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments. Networks 63(1), 119–133 (2014)

    Article  MathSciNet  Google Scholar 

  8. Drexl, M., Rieck, J., Sigl, T., Press, B.: Simultaneous vehicle and crew routing and scheduling for partial- and full-load long-distance road transport. BuR - Business Research 6(2), 242–264 (2013)

    Article  Google Scholar 

  9. Dreyfus, S.E.: An appraisal of some shortest-path algorithms. Operations Research 17(3), 395–412 (1969)

    Article  MATH  Google Scholar 

  10. Focacci, F., Lodi, A., Milano, M.: Embedding relaxations in global constraints for solving TSP and TSPTW. Annals of Mathematics and Artificial Intelligence 34(4), 291–311 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  11. Focacci, F., Lodi, A., Milano, M.: Optimization-oriented global constraints. Constraints 7(3–4), 351–365 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  12. Focacci, F., Lodi, A., Milano, M.: Exploiting relaxations in CP. In: Milano, M. (ed.) Constraint and Integer Programming, Operations Research/Computer Science Interfaces Series, vol. 27, pp. 137–167. Springer, US (2004)

    Google Scholar 

  13. Focacci, F., Lodi, A., Milano, M., Vigo, D.: Solving TSP through the integration of OR and CP techniques. Electronic Notes in Discrete Mathematics 1, 13–25 (1999)

    Article  MathSciNet  Google Scholar 

  14. Francis, K.G., Stuckey, P.J.: Explaining circuit propagation. Constraints 19(1), 1–29 (2014)

    Article  MathSciNet  Google Scholar 

  15. Freling, R., Huisman, D., Wagelmans, A.: Applying an integrated approach to vehicle and crew scheduling in practice. In: Voß, S., Daduna, J. (eds.) Computer-Aided Scheduling of Public Transport. Lecture Notes in Economics and Mathematical Systems, vol. 505, pp. 73–90. Springer, Berlin Heidelberg (2001)

    Chapter  Google Scholar 

  16. Freling, R., Huisman, D., Wagelmans, A.: Models and algorithms for integration of vehicle and crew scheduling. Journal of Scheduling 6(1), 63–85 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  17. Freling, R., Wagelmans, A., Paixão, J.: An overview of models and techniques for integrating vehicle and crew scheduling. In: Wilson, N. (ed.) Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems, vol. 471, pp. 441–460. Springer, Berlin Heidelberg (1999)

    Chapter  Google Scholar 

  18. Haase, K., Desaulniers, G., Desrosiers, J.: Simultaneous vehicle and crew scheduling in urban mass transit systems. Transportation Science 35(3), 286–303 (2001)

    Article  MATH  Google Scholar 

  19. Hollis, B., Forbes, M., Douglas, B.: Vehicle routing and crew scheduling for metropolitan mail distribution at Australia Post. European Journal of Operational Research 173(1), 133–150 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  20. Ibaraki, T.: Algorithms for obtaining shortest paths visiting specified nodes. SIAM Review 15(2), 309–317 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  21. Kilby, P., Prosser, P., Shaw, P.: A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints. Constraints 5(4), 389–414 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  22. Kim, B.I., Koo, J., Park, J.: The combined manpower-vehicle routing problem for multi-staged services. Expert Systems with Applications 37(12), 8424–8431 (2010)

    Article  Google Scholar 

  23. Laporte, G.: What you should know about the vehicle routing problem. Naval Research Logistics (NRL) 54(8), 811–819 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  24. Laporte, G., Mercure, H., Norbert, Y.: Optimal tour planning with specified nodes. RAIRO - Operations Research - Recherche Opérationnelle 18(3), 203–210 (1984)

    MATH  Google Scholar 

  25. Mercier, A., Cordeau, J.F., Soumis, F.: A computational study of benders decomposition for the integrated aircraft routing and crew scheduling problem. Computers & Operations Research 32(6), 1451–1476 (2005)

    Article  MathSciNet  Google Scholar 

  26. Mercier, A., Soumis, F.: An integrated aircraft routing, crew scheduling and flight retiming model. Computers & Operations Research 34(8), 2251–2265 (2007)

    Article  MATH  Google Scholar 

  27. Mesquita, M., Paias, A.: Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem. Computers & Operations Research 35(5), 1562–1575 (2008), part Special Issue: Algorithms and Computational Methods in Feasibility and Infeasibility

    Google Scholar 

  28. Rousseau, L.M., Gendreau, M., Pesant, G.: Using constraint-based operators to solve the vehicle routing problem with time windows. Journal of Heuristics 8(1), 43–58 (2002)

    Article  MATH  Google Scholar 

  29. Shaw, P.: Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  30. Toth, P., Vigo, D.: The Vehicle Routing Problem. Society for Industrial and Applied Mathematics (2002)

    Google Scholar 

  31. Van Hentenryck, P., Michel, L.: The Objective-CP Optimization System. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 8–29. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  32. Volgenant, T., Jonker, R.: On some generalizations of the travelling-salesman problem. The Journal of the Operational Research Society 38(11), 1073–1079 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  33. Yu, G.: Operations Research in the Airline Industry. International Series in Operations Research & Management Science: 9, Springer, US (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. NICTA, Eveleigh, NSW 2015, Australia

    Edward Lam, Pascal Van Hentenryck & Philip Kilby

  2. University of Melbourne, Parkville, VIC, 3010, Australia

    Edward Lam

  3. Australian National University, Acton, ACT, 2601, Australia

    Pascal Van Hentenryck & Philip Kilby

Authors
  1. Edward Lam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pascal Van Hentenryck
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Philip Kilby
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Edward Lam .

Editor information

Editors and Affiliations

  1. École Polytechnique de Montréal, Montréal, Québec, Canada

    Gilles Pesant

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Lam, E., Van Hentenryck, P., Kilby, P. (2015). Joint Vehicle and Crew Routing and Scheduling. In: Pesant, G. (eds) Principles and Practice of Constraint Programming. CP 2015. Lecture Notes in Computer Science(), vol 9255. Springer, Cham. https://doi.org/10.1007/978-3-319-23219-5_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23219-5_45

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23218-8

  • Online ISBN: 978-3-319-23219-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation