Skip to main content
SpringerLink
Log in

Single Flow Routing Through a Network

  • Chapter
  • First Online:
Supply Chain Engineering

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

Abstract

After you have studied this chapter, you should:

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

  • For the class of single-flow routing problems you should know:

    • The characteristics of the base problem and various variants.

    • The mathematical formulation.

    • Dijkstra’s solution algorithm.

    • 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

  • Ahuja, R., Magnanti, T., & Orlin, J. (1993). Network flows. Englewood Cliffs: Prentice-Hall.

    Google Scholar 

  • AMPL Optimization LLC, www.ampl.com.

    Google Scholar 

  • Athanasios, P. (2006). Minimum route finder using Dijkstra’s algorithm. http://students.ceid.upatras.gr/~papagel/english/java_docs/minDijk.htm. Accessed Jan 2006.

    Google Scholar 

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

    Google Scholar 

  • Christofides, N. (1975). Graph theory: An algorithmic approach. New York: Academic Press.

    Google Scholar 

  • Evans, J., & Minieka, E. (1992). Optimization algorithms for networks and graphs (2nd ed.). New York: Marcel Dekker.

    Google Scholar 

  • Fourer, R., Gay, D. M., & Kernighan, B. W. (2002). AMPL: A modeling language for mathematical programming (2nd ed.). Belmont: Duxbury Press.

    Google Scholar 

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

    Google Scholar 

  • ILOG CPLEX File Formats. (2003). ILOG Corporation.

    Google Scholar 

  • Kennington, J., & Helgason, R. (1980). Algorithms for network programming. New York: Wiley.

    Google Scholar 

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). Single Flow Routing Through a Network. 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_6

Download citation

Publish with us

Policies and ethics

Search

Navigation