A two-stage stochastic network model and solution methods for the dynamic empty container allocation problem

Transportation Science

Volumn 32, Issue 2, 1998, Pages 142-162

  Cheung, Raymond K ^a   Chen, Chuen Yih ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CONTAINERS; COST EFFECTIVENESS; DECISION THEORY; MATHEMATICAL MODELS; OPERATIONS RESEARCH; RANDOM PROCESSES;

DYNAMIC EMPTY CONTAINER ALLOCATION; STOCHASTIC QUASI GRADIENT METHOD;

FREIGHT TRANSPORTATION;

EID: 0032073760     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.32.2.142     Document Type: Article

References (24)

1. C. CHEN AND S. CHEN, A Dynamic Container Allocation Model, Working paper, Department of Transportation Management, National Cheng Kung University, Taiwan, 1993.
2. C. CHEN AND K MA, A Stochastic Dynamic Multicommodity Container Allocation Model, Working paper, Department of Transportation Management, National Cheng Kung University, Taiwan, 1995.
3. R. K. CHEUNG AND W. B. POWELL, A Stochastic Hybrid Approximation Procedure, with an Application to Dynamic Networks, Working paper, Department of Industrial and Manufacturing Systems Engineering, Iowa State University, 1995.
4. R. K. CHEUNG AND W. B. POWELL, "An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management," Operations Research, 44(6), 951-963 (1996).
5. T. G. CRAINIC, M. GENDREAU, AND P. DEJAX, "Dynamic Stochastic Models for the Allocation of Empty Containers," Operations Research 41(1), 102-126 (1993).
6. T. G. CRAINIC, M. GENDREAU, P. SORIANO, AND M. TOULOUSE, "A tabu search procedure for multicommodity location-allocation with balancing requirements," Ann. Opns. Res. 41, 359-384 (1993).
7. Division of Economic Analysis, U.S. Department of Transportation Maritime Administration. Review of United States Liner Trades. September, 1993.
8. Y. ERMOLIEV, "Stochastic quasigradient methods," in Numerical Methods in Stochastic Programming, Y. Ermoliev and R. Wets (eds), Springer-Verlag, Berlin, 141-185, 1988.
9. H. FLOREZ, Empty-Container Repositioning and Leasing: An Optimization Model. Ph.D. dissertation, Polytechnic-Institute of New York, 1986.
10. M. FRANK AND P. WOLFE, An algorithm for quadratic programming. Naval Research Logistics Quarterly 3, 95-110 (1956).
11. L. F. FRANTZESKAKIS AND W. B. POWELL, "A successive linear approximation procedure for stochastic, dynamic vehicle allocation problems," Transp. Sci. 24(1), 40-57 (1990).
12. A. M. GUPAL AND L. G. BAZHENOV, "A stochastic method of linearization," Cybernetics, 482-484 (1972).
13. J. L. HIGLE AND S. SEN, Stochastic decomposition: an algorithm for two stage linear programs with recourse. Math. of Oper. Res. 16(3), 650-669 (1991).
14. H. KESTEN, Accelerated stochastic approximation. Annals of Math. Stat. 29, 41-59 (1958).
15. K. K LAI, K LAM, AND W. K CHAN, "Shipping Container Logistics and Allocation," Journal of the Operational Research Society 46, 687-697 (1995).
16. L. LEE AND S. NAHMIAS, Single product, single-location models. In S. C. Graves, A. H. G. Rinnooy Kan, and P. H. Zipkin (eds), Logistics of Production and Inventory. North-Holland, Amsterdam, 1993.
17. J. L. NAZARETH AND R. J-B. WETS, "Nonlinear Programming Techniques," in Numerical Techniques for Stochastic Optimization. Springer-Verlag, Berlin, 95-121, 1988.
18. W. B. POWELL, "A stochastic model of the dynamic vehicle allocation problem," Transp. Sci. 20, 117-129 (1986).
19. W. B. POWELL, A Comparative Review of Alternative Algorithms for the Dynamic Vehicle Allocation Problem, in Vehicle Routing: Methods and Studies, (B. Golden and A. Assad, ed) 249-292, New York, 1988. North Holland.
20. W. B. POWELL, "A review of sensitivity results for linear networks and a new approximation to reduce the effects of degeneracy," Transp. Sci. 23(4), 231-243 (1989).
21. W. B. POWELL AND R. K. CHEUNG, A network recourse decomposition method for dynamic networks with random arc capacities. Networks 24, 369-384 (1994).
22. R. T. ROCKAFELLAR AND R. J-B. WETS, "Scenarios and policy aggregation in optimization under uncertainty," Mathematics of Operation Research 16(1), 119-147 (1991).
23. R. M. VAN SLYKE AND R. J-B. WETS, "L-shaped linear programs with applications to optimal control and stochastic programming," SIAM J. Appl. Math. 17(4), 638-663 (1969).
24. W. W. WHITE, "Dynamic Transshipment Networks: An Algorithm and its Application to the Distribution of Empty Containers," Networks 2(3), 211-236 (1972).