Skip to main content
SpringerLink
Log in

Vehicle Routing and Scheduling

  • Chapter
  • First Online:
Book cover Supply Chain Engineering

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 161))

  • 4416 Accesses

Abstract

After you have studied this chapter, you should:

  • Know the classification system for vehicle routing problems and algorithms.

  • Know the following for each of the classes of vehicle routing and scheduling problems:

    • The characteristics of the base problem and its variants.

    • The mathematical formulation.

    • Simple solution algorithms.

    • How to solve problems of modest size with a computer program.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 159.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

References

Publications

  • ABC News. (2007). UPS figures out the ‘right way’ to save money, time and gas. http://abcnews.go.com/WNT/story?id=3005890.

  • Kearney, A. T. Inc. (1984). Measuring and improving productivity in physical distribution. Oak Brook: National Council of Physical Distribution Management (NCPDM).

    Google Scholar 

  • Balas, E., & Padberg, M. (1976). Set partitioning: A survey. SIAM Review, 18(4), 710–760.

    Article  Google Scholar 

  • Ball, M. O., Magnanti, T. L., Monma, C. L., & Nemhauser, G. L. (Eds.). (1995). Network routing. Amsterdam: Elsevier.

    Google Scholar 

  • Bazaraa, M. S., Jarvis, J. J., & Sherali, H. D. (2005). Linear programming and network flows (3rd ed.). Hoboken: Wiley.

    Google Scholar 

  • Cullen, F., Jarvis, J., & Ratliff, H. (1981). Set partitioning–based heuristics for interactive routing. Networks, 11(2), 125–143.

    Article  Google Scholar 

  • Clarke, G., & Wright, J. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12, 568–581.

    Article  Google Scholar 

  • Deif, I., & Bodin, L. D. (1984). Extension of the Clarke–Wright algorithm for solving the vehicle routing problem with backhauling. In A. E. Kidder (Ed.), Proceedings of the Babson conference on software uses in transportation and logistics management (pp. 75–96) Babson Park.

    Google Scholar 

  • Duhamel, C., Potvin, J.-Y., & Rousseau, J.-M. (1997). A Tabu search heuristic for the vehicle routing problem with Backhauls and time windows. Transportation Science, 31(1), 49–59.

    Article  Google Scholar 

  • Fisher, M. L., & Jaikumar, R. (1981). A generalized assignment heuristic for vehicle routing. Networks, 11(2), 109–124.

    Article  Google Scholar 

  • Fishetti, M., Toth, P., & Vigo, D. (1994). A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs. Operations Research, 42(5), 846–859.

    Article  Google Scholar 

  • Gendreau, M., Laporte, G., & Hertz, A. (1997). An approximation algorithm for the traveling salesman problem with backhauls. Operations Research, 45(4), 639–641.

    Article  Google Scholar 

  • Golden, B., & Assad, A. (Eds.). (1988). Vehicle routing: methods and studies. North Holland: Elsevier.

    Google Scholar 

  • Halse, K. (1992). Modeling and solving complex vehicle routing problems. Ph.D. Dissertation, Technical University of Denmark.

    Google Scholar 

  • Or, I. (1976). Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. Unpublished Ph.D. Dissertation, Northwestern University, Evanston, IL.

    Google Scholar 

  • Savelsbergh, M., & Goetschalckx, M. (1994). A comparison of the efficiency of fixed versus variable vehicle routes. Journal of Business Logistics, 16(1), 163–188.

    Google Scholar 

  • Schrijver, A. (1990). On the history of transportation and maximum flow problems. Unpublished manuscript, Center for Wiskunde en Informatica (CWI), Amsterdam, the Netherlands, cwi.homepages.nl.

    Google Scholar 

  • Toth, P., & Vigo, D. (1996). A heuristic algorithm for the vehicle rrouting problem with backhauls. In L. Bianco & P. Toth (Eds.), Advanced methods in transportation analysis (pp. 585–608).Berlin: Springer.

    Google Scholar 

  • Toth, P., & Vigo, D. (1997). An exact algorithm for the vehicle routing problem with backhauls. Transportation Science, 31(4), 372–386.

    Article  Google Scholar 

Programs

Download references

Author information

Authors and Affiliations

  1. H. Milton Stewart School of Industrial & Systems Engineering, Georgia Institute of Technology, Ferst Drive NW., 765, 30332-0205, Atlanta, Georgia, USA

    Marc Goetschalckx

Authors
  1. Marc Goetschalckx
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marc Goetschalckx .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Goetschalckx, M. (2011). Vehicle Routing and Scheduling. In: Supply Chain Engineering. International Series in Operations Research & Management Science, vol 161. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-6512-7_9

Download citation

Publish with us

Policies and ethics

Search

Navigation