A Two-Stage Stochastic Network Model and Solution Methods for the Dynamic Empty Container Allocation Problem

Published Online:https://doi.org/10.1287/trsc.32.2.142

References

  • Chen C. , Chen S. A dynamic container allocation model. (1993) . Working paper, Department of Transportation Management, National Cheng Kung University, Taiwan Google Scholar
  • Chen C. , Ma K. A stochastic dynamic multicommodity container allocation model. (1995) . Working paper, Department of Transportation Management, National Cheng Kung University, Taiwan Google Scholar
  • Cheung R. K. , Powell W. B. A stochastic hybrid approximation procedure, with an application to dynamic networks. (1995) . Working paper, Department of Industrial and Manufacturing Systems Engineering, Iowa State University Google Scholar
  • Cheung R. K. , Powell W. B. An algorithm for multistage dynamic networks with random arc capacities, with an application to dynamic fleet management. Oper. Res. (1996) 44 6 951 963 LinkGoogle Scholar
  • Crainic T. G. , Gendreau M. , Dejax P. Dynamic stochastic models for the allocation of empty containers. Oper. Res. (1993) 41 1 102 126 LinkGoogle Scholar
  • Crainic T. G. , Gendreau M. , Soriano P. , Toulouse M. A Tabu search procedure for multicommodity location-allocation with balancing requirements. Ann. Opns. Res. (1993) 41 359 384 CrossrefGoogle Scholar
  • Division of Economic Analysis (1993) . U.S. Department of Transportation Maritime Administration. Review of United States Liner Trades. September Google Scholar
  • Ermoliev Y. , Ermoliev Y. , Wets R. Stochastic quasigradient methods. Numerical Methods in Stochastic Programming (1988) (Springer-Verlag, Berlin) 141 185 Google Scholar
  • Florez H. Empty-container repositioning and leasing: An optimization model. (1986) . Ph.D. dissertation, Polytechnic-Institute of New York Google Scholar
  • Frank M. , Wolfe P. An algorithm for quadratic programming. Naval Res. Logist. Quart. (1956) 3 95 110 CrossrefGoogle Scholar
  • Frantzeskakis L. F. , Powell W. B. A successive linear approximation procedure for stochastic, dynamic vehicle allocation problems. Transportation Sci. (1990) 24 1 40 57 LinkGoogle Scholar
  • Gupal A. M. , Bazhenov L. G. A stochastic method of linearization. Cybernetics (1972) 482 484 Google Scholar
  • Higle J. L. , Sen S. Stochastic decomposition: An algorithm for two stage linear programs with recourse. Math. Oper. Res. (1991) 16 3 650 669 LinkGoogle Scholar
  • Kesten H. Accelerated stochastic approximation. Ann. Math. Stat. (1958) 29 41 59 CrossrefGoogle Scholar
  • Lai K. K. , Lam K. , Chan W. K. Shipping container logistics and allocation. J. Oper. Res. Soc. (1995) 46 687 697 CrossrefGoogle Scholar
  • Lee L. , Nahmias S. , Graves S. C. , Rinnooy Kan A. H. G. , Zipkin P. H. Single product, single-location models. Logistics of Production and Inventory (1993) (North-Holland, Amsterdam) CrossrefGoogle Scholar
  • Nazareth J. L. , Wets R. J-B. Nonlinear programming techniques. Numerical Techniques for Stochastic Optimization (1988) (Springer-Verlag, Berlin) 95 121 CrossrefGoogle Scholar
  • Powell W. B. A stochastic model of the dynamic vehicle allocation problem. Transportation Sci. (1986) 20 117 129 LinkGoogle Scholar
  • Powell W. B. , Golden B. , Assad A. A comparative review of alternative algorithms for the dynamic vehicle allocation problem. Vehicle Routing: Methods and Studies (1988) (North Holland, New York) 249 292 Google Scholar
  • Powell W. B. A review of sensitivity results for linear networks and a new approximation to reduce the effects of degeneracy. Transportation Sci. (1989) 23 4 231 243 LinkGoogle Scholar
  • Powell W. B. , Cheung R. K. A network recourse decomposition method for dynamic networks with random arc capacities. Networks (1994) 24 369 384 CrossrefGoogle Scholar
  • Rockafellar R. T. , Wets R. J-B. Scenarios and policy aggregation in optimization under uncertainty. Math. Oper. Res. (1991) 16 1 119 147 LinkGoogle Scholar
  • Van Slyke R. M. , Wets R. J-B. L-shaped linear programs with applications to optimal control and stochastic programming. SIAM J. Appl. Math. (1969) 17 4 638 663 CrossrefGoogle Scholar
  • White W. W. Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers. Networks (1972) 2 3 211 236 CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.