Skip to main content

Routing Multiple Flows Through a Network

  • Chapter
  • First Online:
Supply Chain Engineering

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

  • 4181 Accesses

Abstract

Network flow models are some of the most frequently used tools for the planning of logistics systems because there exists a natural correspondence between the mathematical network flow formulation and the elements of the real-world supply chain network. The supply chain network consists of a number of suppliers that generate products transported over transportation channels through various intermediate facilities to a number of customers. Limiting capacities may exist on the transportation channels, the intermediate facilities, and capacity limitations on available goods at the suppliers may also exist. Demand satisfaction of the customers corresponds to a required outflow of products from the network. The mathematical network consists of nodes and arcs. The nodes can be further classified as sources that generate flow, intermediate nodes that neither generate nor consume flow, and destinations that consume flow. The nodes are connected by directional arcs. The arcs may have capacity limitations for individual flow types or jointly for all flows. A network flow schematic is illustrated in Fig. 7.1.

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

Access this chapter

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

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

    Google Scholar 

  • AMPL Optimization LLC, www.ampl.com.

    Google Scholar 

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

    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 

  • Ford, L. R. Jr., & Fulkerson, D. R. (1956). “Maximal flow through a network”. Canadian Journal of Mathematics, 99–404.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

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). Routing Multiple Flows 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_7

Download citation

Publish with us

Policies and ethics