Robust Optimization for Empty Repositioning Problems

References

• Abrache J., Crainic T. G., Gendreau M. A new decomposition algorithm for the deterministic dynamic allocation of empty containers. (1999) . Technical Report CRT-99-49, Centre de Recherche sur les Transport, Montreal, Quebec, CanadaGoogle Scholar
• Ahmed S., Shapiro A. Two-stage robust network flow and design under demand uncertainty. Optim. Online (2002) . http://www.optimization-online.orgGoogle Scholar
• Atamturk A., Zhang M. Two-stage robust network flow and design under demand uncertainty. Oper. Res. (2007) 55(4):662–673Link, Google Scholar
• Ben-Tal A., Nemirovski A. Robust convex optimization. Math. Oper. Res. (1998) 23:769–805Link, Google Scholar
• Ben-Tal A., Nemirovski A. Robust solutions of linear programming problems contaminated with uncertain data. Math. Programming (2000) 88:411–424Crossref, Google Scholar
• Ben-Tal A., Goryashko A., Guslitzer E., Nemirovski A. Adjustable robust solutions of uncertain linear programs. Math. Programming (2004) 99:351–376Crossref, Google Scholar
• Bertsimas D., Sim M. Robust discrete optimization and network flows. Math. Programming (2003) 98:49–71Crossref, Google Scholar
• Bertsimas D., Sim M. The price of robustness. Oper. Res. (2004) 52:35–53Link, Google Scholar
• Bertsimas D., Thiele A. A robust optimization approach to supply chain management. Integer Programming and Combinatorial Optimization, 10th International IPCO Conference (2004) (Springer, New York) 86–100Crossref, Google Scholar
• Bertsimas D., Thiele A. A robust optimization approach to inventory theory. Oper. Res. (2006) 54:150–168Link, Google Scholar
• Bertsimas D., Pachamanova D., Sim M. Robust linear optimization under general norms. Oper. Res. Lett. (2004) 32:510–516Crossref, Google Scholar
• Birge J. R., Louveaux F.Introduction to Stochastic Programming (1999) (Springer, New York) Google Scholar
• Cheung R. K. M., Powell W. B. An algorithm for multistage dynamic networks with random arc capacities, with an application to dynamic fleet management. Oper. Res. (1996) 44:951–963Link, Google Scholar
• Cook W. J., Cunningham W. H., Pulleyblank W. R., Schrijver A.Combinatorial Optimization (1998) (John Wiley and Sons, New York) Google Scholar
• Crainic T. G., Gendreau M., Dejax P. Dynamic stochastic models for the allocation of empty containers. Oper. Res. (1993) 41:102–126Link, Google Scholar
• Erera A. L., Morales J. C., Savelsbergh M. W. P. Global intermodal tank container management for the chemical industry. Transportation Res., Part E (2005) 41:551–566Crossref, Google Scholar
• Frantzeskakis L., Powell W. B. A successive linear approximation procedure for stochastic, dynamic vehicle allocation problems. Transportation Sci. (1990) 24:40–57Link, Google Scholar
• Godfrey G., Powell W. B. An adaptive dynamic programming algorithm for single-period fleet management problems I: Single period travel times. Transportation Sci. (2002a) 36:21–39Link, Google Scholar
• Godfrey G., Powell W. B. An adaptive dynamic programming algorithm for single-period fleet management problems II: Multiperiod travel times. Transportation Sci. (2002b) 36:40–54Link, Google Scholar
• Kleywegt A., Shapiro A., Homem-de-Mello T. The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. (2001) 12:479–502Crossref, Google Scholar
• Kouvelis P., Yu G.Robust Discrete Optimization and Its Applications (1997) (Kluwer Academic Publishers, Dordrecht, Germany) Crossref, Google Scholar
• Leddon C., Wrathall E. Scheduling empty freight car fleets on the Louisville and Nashville Railroad. Second Internat. Sympos. Use of Cybernetics on the Railways (1967) October 1–6Montreal, Quebec, CanadaGoogle Scholar
• Misra S. Linear programming of empty wagon disposition. Rail Internat. (1972) 3:151–158Google Scholar
• Powell W. B. A stochastic formulation of the dynamic vehicle allocation problem. Transportation Sci. (1986) 20:117–129Link, Google Scholar
• Powell W. B. An operational planning model for the dynamic vehicle allocation problem with uncertain demands. Transportation Res., Part B (1987) 21B:217–232Crossref, Google Scholar
• Powell W. B., Graves S., De Kok A. G. Dynamic models of transportation operations. Handbooks in Operations Research and Management Science: Supply Chain Management (2003) (Elsevier, Amsterdam) 677–756Crossref, Google Scholar
• Soyster A. L. Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. (1973) 21:1154–1157Link, Google Scholar
• Stolt-Nielsen Transportation Group (2004) . Private communicationGoogle Scholar
• Topaloglu H., Powell W. B. Dynamic-programming approximations for stochastic time-staged integer multicommodity-flow problems. INFORMS J. Comput. (2006) 18(1):31–42Link, Google Scholar
• White W. Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers. Networks (1972) 2:211–236Crossref, Google Scholar