TY - JOUR
T1 - Stochastic and dynamic networks and routing
AU - Powell, Warren Buckler
AU - Jaillet, Patrick
AU - Odoni, Amedeo
N1 - Funding Information:
This research was supported in part by grant DDM-9102134 from the National Science Foundation, and by grant AFOSR-F49620-93-1-0098 from the Air Force Office of Scientific Research.
PY - 1995/1/1
Y1 - 1995/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=77957806193&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77957806193&partnerID=8YFLogxK
U2 - 10.1016/S0927-0507(05)80107-0
DO - 10.1016/S0927-0507(05)80107-0
M3 - Review article
AN - SCOPUS:77957806193
SN - 0927-0507
VL - 8
SP - 141
EP - 295
JO - Handbooks in Operations Research and Management Science
JF - Handbooks in Operations Research and Management Science
IS - C
ER -