Stochastic and dynamic networks and routing

Warren Buckler Powell, Patrick Jaillet, Amedeo Odoni

Research output: Contribution to journalReview articlepeer-review

248 Scopus citations


This chapter discusses stochastic and dynamic networks and routing. The chapter discusses priori optimization in routing, shortest paths, traveling salesman-type problems and vehicle routing. These problems arise when decisions must be made before random outcomes (typically customer demands) are known. The chapter covers dynamic models of problems arising in transportation and logistics, and includes a discussion of important modeling issues, as well as a summary of dynamic models for a number of key problem areas. Dynamic networks provide an important foundation for addressing many problems in logistics planning. Algorithms that have been specialized for dynamic networks are presented. The results for solving infinite networks, including both exact results for stationary infinite networks, and model truncation techniques are briefly discussed. The chapter presents basic results and concepts from the field of stochastic programming, oriented toward their application to network problems. This discussion provides a general framework for formulating and solving stochastic, dynamic network problems. That framework is used to present two stochastic programming models.

Original languageEnglish (US)
Pages (from-to)141-295
Number of pages155
JournalHandbooks in Operations Research and Management Science
Issue numberC
StatePublished - Jan 1 1995

All Science Journal Classification (ASJC) codes

  • Finance
  • Economics and Econometrics
  • Computer Science Applications
  • Management Science and Operations Research


Dive into the research topics of 'Stochastic and dynamic networks and routing'. Together they form a unique fingerprint.

Cite this