Dynamic Container Deployment: Two-Stage Robust Model, Complexity, and Computational Results

References

• Abrache J, Crainic TG, Gendreau M (1999) A new decomposition algorithm for the deterministic dynamic allocation of empty containers. Technical Report CRT-99-49, Centre de recherche sur les transports, University de Montreal, Montreal, Quebec, Canada.Google Scholar
• Atamtürk A, Zhang M (2007) Two-stage robust network flow and design under demand uncertainty. Oper. Res. 55(4):662–673.Link, Google Scholar
• Bandeira DL, Becker JL, Borenstein D (2009) A DSS for integrated distribution of empty and full containers. Decision Support Systems 47(4):383–397.Crossref, Google Scholar
• Ben-Tal A, Nemirovski A (1998) Robust convex optimization. Math. Oper. Res. 23(4):769–805.Link, Google Scholar
• Ben-Tal A, Nemirovski A (2000) Robust solutions of linear programming problems contaminated with uncertain data. Math. Programming 88(3):411–424.Crossref, Google Scholar
• Ben-Tal A, Goryashko E, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math. Programming 99(2):351–376.Crossref, Google Scholar
• Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math. Programming 98(1–3):49–71.Crossref, Google Scholar
• Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 52(1):35–53.Link, Google Scholar
• Chang H, Jula H, Chassiakos A, Ioannou P (2008) A heuristic solution for the empty container substitution problem. Transportation Res. Part E: Logist. Transportation Rev. 44(2):203–216.Crossref, Google Scholar
• Chen X, Sim M, Sun P (2007) A robust optimization perspective on stochastic programming. Oper. Res. 55(6):1058–1071.Link, Google Scholar
• Chen X, Sim M, Sun P, Zhang J (2008) A linear decision-based approximation approach to stochastic programming. Oper. Res. 56(2):344–357.Link, Google Scholar
• Cheung RK, Chen CY (1998) A two-stage stochastic network model and solution methods for the dynamic empty container allocation problem. Transportation Sci. 32(2):142–162.Link, Google Scholar
• Cheung RK, Powell WB (1996) An algorithm for multistage dynamic networks with random arc capacities, with an application to dynamic fleet management. Oper. Res. 44(6):951–963.Link, Google Scholar
• Choong ST, Cole MH, Kutanoglu E (2002) Empty container management for intermodal transportation networks. Transportation Res. Part E 38(6):423–438.Crossref, Google Scholar
• Crainic TG, Gendreau M, Dejax P (1993) Dynamic and stochastic models for the allocation of empty containers. Oper. Res. 41(1):102–126.Link, Google Scholar
• Di Francesco M, Crainic TG, Zuddas P (2009) The effect of multi-scenario policies on empty container repositioning. Transportation Res. Part E: Logist. Transportation Rev. 45(5):758–770.Crossref, Google Scholar
• Dong JX, Song DP (2009) Container fleet sizing and empty repositioning in liner shipping systems. Transportation Res. Part E: Logist. Transportation Rev. 45(6):860–877.Crossref, Google Scholar
• Erera AL, Morales JC, Savelsbergh M (2005) Global intermodal tank container management for the chemical industry. Transportation Res. Part E 41(6):551–566.Crossref, Google Scholar
• Erera AL, Morales JC, Savelsbergh M (2009) Robust optimization for empty repositioning problems. Oper. Res. 57(2):468–483.Link, Google Scholar
• Florez H (1986) Empty container repositioning and leasing: An optimization model. Unpublished doctoral dissertation, Polytechnic Institute of New York, New York.Google Scholar
• Frantzeskakis LF, Powell WB (1990) A successive linear approximation procedure for stochastic, dynamic vehicle allocation problems. Transportation Sci. 24(1):40–57.Link, Google Scholar
• Godfrey GA, Powell WB (2002a) An adaptive dynamic programming algorithm for dynamic fleet management I: Single period travel times. Transportation Sci. 36(1):21–39.Link, Google Scholar
• Godfrey GA, Powell WB (2002b) An adaptive dynamic programming algorithm for dynamic fleet management II: Multiperiod travel times. Transportation Sci. 36(1):40–54.Link, Google Scholar
• Jula H, Chassiakos A, Ioannou P (2006) Port dynamic empty container reuse. Transportation Res. Part E 42(1):43–60.Crossref, Google Scholar
• Karimi IA, Sharafali M, Mahalingam H (2005) Scheduling tank container movements for chemical logistics. Amer. Institute of Chemical Engrg. J. 51(1):178–197.Crossref, Google Scholar
• Lai KK, Lam K, Chan WK (1995) Shipping container logistics and allocation. J. Oper. Res. Soc. 46(6):687–697.Crossref, Google Scholar
• Lam SW, Lee LH, Tang LC (2007) An approximate dynamic programming approach for the empty container allocation problem. Transportation Res. Part C 15(4):265–277.Crossref, Google Scholar
• Li JA, Leung SCH, Wu Y, Liu K (2007) Allocation of empty containers between multi-ports. Eur. J. Oper. Res. 182(1):400–412.Crossref, Google Scholar
• Liebchen C, Lübbecke M, Möhring RH, Stiller S (2007) Recoverable robustness. Technical report ARRIVAL-TR-0066, ARRIVAL Project, Technical University of Berlin, Berlin.Google Scholar
• Liebchen C, Lübbecke M, Möhring RH, Stiller S (2009) The concept of recoverable robustness, linear programming recovery, and railway applications. Ahuja RK, Möhring RH, Zaroliagis CD, eds. Robust and Online Large-Scale Optimization, Lecture Notes in Computer Science (Springer-Verlag, Berlin), 1–27.Crossref, Google Scholar
• Mangasarian OL, Shiau TH (1986) A variable-complexity norm maximization problem. SIAM J. Algebraic Discrete Methods 7(3):455–461.Crossref, Google Scholar
• Powell WB (1986) A stochastic model of the dynamic vehicle allocation problem. Transportation Sci. 20(2):117–129.Link, Google Scholar
• Powell WB (2003) Dynamic models of transportation operations. Graves S, De Kok AG, eds. Handbooks in Operations Research and Management Science: Supply Chain Management (Elsevier, Amsterdam), 677–756.Crossref, Google Scholar
• Shen WS, Khoong CM (1995) A DSS for empty container distribution planning. Decision Support Systems 15(1):75–82.Crossref, Google Scholar
• Shintani K, Imai A, Nishimura E, Papadimitriou S (2007) The container shipping network design problem with empty container repositioning. Transportation Res. Part E 43(1):39–59.Crossref, Google Scholar
• Soyster AL (1973) Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21(5):1154–1157.Link, Google Scholar
• Stiller S (2009) Extending concepts of reliability, network creation games, real-time scheduling, and robust optimization. Unpublished doctoral dissertation, Technical University of Berlin, Berlin.Google Scholar
• Thiele A, Terry T, Epelman M (2010) Robust linear optimization with recourse. Working paper, Lehigh University, Bethlehem, PA.Google Scholar
• Topaloglu H, Powell WB (2006) Dynamic-programming approximations for stochastic time-staged integer multicommodity-flow problems. INFORMS J. Comput. 18(1):31–42.Link, Google Scholar
• White WW (1972) Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers. Networks 2(3):211–236.Crossref, Google Scholar