Routing Multiple Flows Through a Network

  • Marc GoetschalckxEmail author
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 161)


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.


Short Path Destination Node Sink Node Network Flow Short Path Length 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. Ahuja, R., Magnanti, T., & Orlin, J. (1993). Network flows. Englewood Cliffs: Prentice-Hall.Google Scholar
  2. AMPL Optimization LLC, Scholar
  3. Bazaraa, M. S., Jarvis, J. J., & Sherali, H. D. (2005). Linear programming and network flows (3rd ed.). Hoboken: Wiley.Google Scholar
  4. Christofides, N. (1975). Graph theory: An algorithmic approach. New York: Academic Press.Google Scholar
  5. Evans, J. & Minieka, E. (1992). Optimization algorithms for networks and graphs (2nd ed.). New York: Marcel Dekker.Google Scholar
  6. Ford, L. R. Jr., & Fulkerson, D. R. (1956). “Maximal flow through a network”. Canadian Journal of Mathematics, 99–404.Google Scholar
  7. 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
  8. Kennington, J., & Helgason, R. (1980). Algorithms for network programming. New York: Wiley.Google Scholar
  9. Schrijver, A. (1990). “On the history of transportation and maximum flow problems,” Unpublished manuscript, Centrum for Wiskunde & Informatica (CWI). Amsterdam, Netherlands, Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.H. Milton Stewart School of Industrial & Systems EngineeringGeorgia Institute of TechnologyAtlantaUSA

Personalised recommendations