Chapter 5 Dynamic Models for Freight Transportation

Handbooks in Operations Research and Management Science

Volumn 14, Issue C, 2007, Pages 285-365

  Powell, Warren B ^a   Bouzaïene Ayari, Belgacem ^a   Simão, Hugo P ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77950478159     PISSN: 09270507     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0927-0507(06)14005-0     Document Type: Review

References (62)

1. Aronson J., and Chen B. A forward network simplex algorithm for solving multiperiod network flow problems. Naval Research Logistics Quarterly 33 3 (1986) 445-467
2. Aronson J., and Thompson G.L. A survey on forward methods in mathematical programming. Large Scale Systems 7 (1984) 1-16
3. Assad A. Multicommodity network flows: A survey. Networks 8 1 (1978) 37-91
4. Baker S., Morton D., Rosenthal R., and Williams L. Optimizing military airlift. Operations Research 50 4 (2002) 582-602
5. Barnhart C., Hane C.A., Johnson E.L., and Sigismondi G. Branch-and-price: Column generation for solving huge integer programs. Operations Research 46 3 (1998) 316-329
6. Bellman R. Dynamic Programming (1957), Princeton Univ. Press, Princeton
7. Bellman R., and Dreyfus S. Functional approximations and dynamic programming. Mathematical Tables and Other Aids to Computation 13 (1959) 247-251
8. Bertazzi L., and Speranza M.G. Inventory control on sequences of links with given transportation frequencies. International Journal of Production Economics 59 (1999) 261-270
9. Bertazzi L., and Speranza M.G. Minimizing logistic costs in multistage supply chains. Naval Research Logistics 46 (1999) 399-417
10. Bertazzi, L., Bertsekas, D., Speranza, M.G. (2000). Optimal and neuro-dynamic programming solutions for a stochastic inventory trasportation problem. Unpublished technical report, Universita Degli Studi Di Brescia
11. Bertsekas D., and Tsitsiklis J. Neuro-Dynamic Programming (1996), Athena Scientific, Belmont, MA
12. Birge J., and Louveaux F. Introduction to Stochastic Programming (1997), Springer-Verlag, New York
13. Blum J. Multidimensional stochastic approximation methods. Annals of Mathematical Statistics 25 (1954) 737-744
14. Cheung R., and Powell W.B. An algorithm for multistage dynamic networks with random arc capacities, with an application to dynamic fleet management. Operations Research 44 6 (1996) 951-963
15. Cheung R.K.-M., and Powell W.B. SHAPE: A stochastic hybrid approximation procedure for two-stage stochastic programs. Operations Research 48 1 (2000) 73-79
16. Cinlar, E. (2003). Private communication
17. Crainic T. Network design in freight transportation. European Journal of Operational Research 12 2 (2000) 272-288
18. Crainic T., and Rousseau J.-M. Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem. Transportation Research B 20 (1988) 290-297
19. Crainic T., and Roy J. OR tools for the tactical planning of freight transportation. European Journal of Operations Research 33 (1988) 290-297
20. Desrochers M., and Soumis F. A column generation approach to the urban transit crew scheduling problem. Transportation Science 23 (1989) 1-13
21. Desrosiers J., Soumis F., and Desrochers M. Routing with time windows by column generation. Networks 14 (1984) 545-565
22. Desrosiers J., Solomon M., and Soumis F. Time constrained routing and scheduling. In: Monma C., Magnanti T., and Ball M. (Eds). Network Routing. Handbooks in Operations Research and Management Science (1995), North-Holland, Amsterdam 35-139
23. Ford L., and Fulkerson D. Flows in Networks (1962), Princeton Univ. Press, Princeton
24. Glockner G.D., and Nemhauser G.L. A dynamic network flow problem with uncertain arc capacities: Formulation and problem structure. Operations Research 48 (2000) 233-242
25. Glover F., Karney D., Klingman D., and Napier A. A computation study on start procedures, basis change criteria, and solution algorithms for transportation problems. Management Science 20 (1974) 793-813
26. Glover F., Klingman D., and Phillips N.V. Network Models in Optimization and Their Application in Practice (1992), Wiley, New York
27. Godfrey G.A., and Powell W.B. An adaptive, distribution-free approximation for the newsvendor problem with censored demands, with applications to inventory and distribution problems. Management Science 47 8 (2001) 1101-1112
28. Godfrey G.A., and Powell W.B. An adaptive, dynamic programming algorithm for stochastic resource allocation problems I: Single period travel times. Transportation Science 36 1 (2002) 21-39
29. Graves S.C. Multi-stage lot sizing: An iterative procedure. In: Schwarz L.B. (Ed). Multi-Level Production/Inventory Control Systems: Theory and Practice. TIMS Studies in the Management Sciences vol. 16 (1981), North-Holland, New York 95-110
30. Infanger G. Planning under Uncertainty: Solving Large-Scale Stochastic Linear Programs. The Scientific Press Series (1994), Boyd & Fraser, New York
31. Kall P., and Wallace S. Stochastic Programming (1984), Wiley, New York
32. Kennington J.L. A survey of linear cost multicommodity network flows. Operations Research 26 (1978) 209-236
33. Kennington J., and Helgason R. Algorithms for Network Programming (1980), Wiley, New York
34. Kushner H.J., and Yin G.G. Stochastic Approximation Algorithms and Applications (1997), Springer-Verlag, New York
35. Langley R.W., Kennington J.L., and Shetty C.M. Efficient computational devices for the capacitated transportation problem. Naval Research Logistics Quarterly 21 (1974) 637-647
36. Lasdon L. Optimization Theory for Large Systems (1970), MacMillan Co, New York
37. Lavoie S., Minoux M., and Odier E. A new approach of crew pairing problems by column generation and application to air transport. European Journal of Operational Research 35 (1988) 45-58
38. Marar, A., Powell, W.B. (2004). Using static flow patterns in time-staged resource allocation problems. Technical report, Princeton University, Department of Operations Research and Financial Engineering
39. Marar A., Powell W.B., and Kulkarni S. Combining cost-based and rule-based knowledge in complex resource allocation problems. IIE Transactions 38 2 (2006) 159-172
40. Morton D.P., Rosenthal R.E., and Lim T.W. Optimization modeling for airlift mobility. Military Operations Research 1 (1996) 49-67
41. Morton D.P., Salmeron J., and Wood R.K. A stochastic program for optimizing military sealift subject to attack. Stochastic Programming e-print Series (2003). http://www.speps.info Available at
42. Papadaki K., and Powell W.B. An adaptive dynamic programming algorithm for a stochastic multiproduct batch dispatch problem. Naval Research Logistics 50 7 (2003) 742-769
43. Powell W.B. A local improvement heuristic for the design of less-than-truckload motor carrier networks. Transportation Science 20 4 (1986) 246-257
44. Powell W.B. An operational planning model for the dynamic vehicle allocation problem with uncertain demands. Transportation Research 21 (1987) 217-232
45. Powell W.B., Shapiro J.A., and Simão H.P. A representational paradigm for dynamic resource transformation problems. In: Coullard R.F.C., and Owens J.H. (Eds). Annals of Operations Research (2001), J.C. Baltzer AG, Basel 231-279
46. Powell W.B., Shapiro J.A., and Simão H.P. An adaptive dynamic programming algorithm for the heterogeneous resource allocation problem. Transportation Science 36 2 (2002) 231-249
47. Powell W.B., Wu T.T., and Whisman A. Using low dimensional patterns in optimizing simulators: An illustration for the airlift mobility problem. Mathematical and Computer Modelling 39 (2004) 657-675
48. Puterman M.L. Markov Decision Processes (1994), Wiley, New York
49. Robbins H., and Monro S. A stochastic approximation method. Annals of Mathematical Statistics 22 (1951) 400-407
50. Sen S., and Higle J. An introductory tutorial on stochastic linear programming models. Interfaces 29 2 (1999) 33-61
51. Shapiro J., and Powell W.B. A metastrategy for dynamic resource management problems based on informational decomposition. Informs Journal on Computing 18 1 (2006) 43-60
52. Speranza M., and Ukovich W. Minimizing trasportation and inventory costs for several products on a single link. Operations Research 42 (1994) 879-894
53. Speranza M., and Ukovich W. An algorithm for optimal shipments with given frequencies. Naval Research Logistics 43 (1996) 655-671
54. Spivey M., and Powell W.B. The dynamic assignment problem. Transportation Science 38 4 (2004) 399-419
55. Sutton R. Learning to predict by the methods of temporal differences. Machine Learning 3 (1988) 9-44
56. Sutton R., and Barto A. Reinforcement Learning (1998), MIT Press, Cambridge, Massachusetts
57. Topaloglu H., and Powell W.B. Dynamic programming approximations for stochastic, time-staged integer multicommodity flow problems. Informs Journal on Computing 18 1 (2006) 31-42
58. Tsitsiklis J., and Van Roy B. An analysis of temporal-difference learning with function approximation. IEEE Transactions on Automatic Control 42 (1997) 674-690
59. Van Roy B. Neuro-dynamic programming: Overview and recent trends. In: Feinberg E., and Shwartz A. (Eds). Handbook of Markov Decision Processes: Methods and Applications (2001), Kluwer Academic, Boston 431-460
60. Vance P.H., Barnhart C., Johnson E.L., and Nemhauser G.L. Airline crew scheduling: A new formulation and decomposition algorithm. Operations Research 45 2 (1997) 188-200
61. White W. Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers. Networks 2 3 (1972) 211-236
62. Wu, T.T., Powell, W.B., Whisman, A. (2003). The optimizing simulator: An intelligent analysis tool for the airlift mobility problem. Technical report, Princeton University, Department of Operations Research and Financial Engineering