Robust Service Network Design Under Demand Uncertainty

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

References

  • Agra A, Christiansen M, Figueiredo R, Hvattum LM, Poss M, Requejo C (2013) The robust vehicle routing problem with time windows. Comput. Oper. Res. 40(3):856–866.CrossrefGoogle Scholar
  • An Yu, Zeng B (2015) Exploring the modeling capacity of two-stage robust optimization: variants of robust unit commitment model. IEEE Trans. Power Systems 30(1):109–122.CrossrefGoogle Scholar
  • An Yu, Zeng B, Zhang Y, Zhao L (2014) Reliable p-median facility location problem: two-stage robust models and algorithms. Transportation Res. Part B: Methodological 64:54–72.CrossrefGoogle Scholar
  • Andersen J, Christiansen M, Crainic TG, Grønhaug R (2011) Branch and price for service network design with asset management constraints. Transportation Sci. 45(1):33–49.LinkGoogle Scholar
  • Andersen J, Crainic TG, Christiansen M (2009) Service network design with asset management: formulations and comparative analyses. Transportation Res. Part C: Emerging Tech. 17(2):197–207.CrossrefGoogle Scholar
  • Atamtürk A, Zhang M (2007) Two-stage robust network flow and design under demand uncertainty. Oper. Res. 55(4):662–673.LinkGoogle Scholar
  • Bai R, Wallace SW, Li J, Chong YL (2014) Stochastic service network design with rerouting. Transportation Res. Part B: Methodological 60(1):50–65.CrossrefGoogle Scholar
  • Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math. Programming 99(2):351–376.CrossrefGoogle Scholar
  • Bertsimas D, Brown DB, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev. 53(3):464–501.CrossrefGoogle Scholar
  • Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 52(1):35–53.LinkGoogle Scholar
  • Bertsimas D, Thiele A (2006) A robust optimization approach to inventory theory. Oper. Res. 54(1):150–168.LinkGoogle Scholar
  • Cheng C, Qi M, Zhang Y, Rousseau L-M (2018) A two-stage robust approach for the reliable logistics network design problem. Transportation Res. Part B: Methodological 111:185–202.CrossrefGoogle Scholar
  • Chouman M, Crainic TG (2014) Cutting-plane matheuristic for service network design with design-balanced requirements. Transportation Sci. 49(1):99–113.LinkGoogle Scholar
  • Cordeau JF, Toth P, Vigo D (1998) A survey of optimization models for train routing and scheduling. Transportation Sci. 32(4):380–404.LinkGoogle Scholar
  • Crainic TG (2000) Service network design in freight transportation. European J. Oper. Res. 122(2):272–288.CrossrefGoogle Scholar
  • Crainic TG (2003) Long-haul freight transportation. Hall RW, ed. Handbook of Transportation Science (Springer, New York), 451–516.Google Scholar
  • Crainic TG, Hewitt M, Toulouse M, Vu DM (2014) Service network design with resource constraints. Transportation Sci. 50(4):1380–1393.LinkGoogle Scholar
  • Crainic TG, Kim KH (2007) Intermodal transportation. Barnhart C, Laporte G, eds. Transportation, Handbooks in Operations Research and Management Science, vol. 14 (Elsevier, Amsterdam), 467–537.CrossrefGoogle Scholar
  • Gabrel V, Lacroix M, Murat C, Remli N (2014) Robust location transportation problems under uncertain demands. Discrete Appl. Math. 164:100–111.CrossrefGoogle Scholar
  • Ghamlouche I, Crainic TG, Gendreau M (2003) Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. Oper. Res. 51(4):655–667.LinkGoogle Scholar
  • Ghamlouche I, Crainic TG, Gendreau M (2004) Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design. Ann. Oper. Res. 131(1):109–133.CrossrefGoogle Scholar
  • Hoff A, Lium A-G, Løkketangen A, Crainic TG (2010) A metaheuristic for stochastic service network design. J. Heuristics 16(5):653–679.CrossrefGoogle Scholar
  • Horst R, Tuy H (1990) Global Optimization: Deterministic Approaches (Springer, New York).CrossrefGoogle Scholar
  • Jiang R, Zhang M, Li G, Guan Y (2012) Benders’ decomposition for the two-stage security constrained robust unit commitment problem. 62nd IIE Annual Conf. Expo 2012 Proc. (Elsevier, Amsterdam).Google Scholar
  • Lium AG, Crainic TG, Wallace SW (2009) A study of demand stochasticity in service network design. Transportation Sci. 43(2):144–157.LinkGoogle Scholar
  • Magnanti, TL, Wong RT (1984) Network design and transportation planning: models and algorithms. Transportation Sci. 18(1):1–55.LinkGoogle Scholar
  • Marielle C, Kjetil F, Bjørn N, David R (2007) Maritime transportation. Barnhart C, Laporte G, eds. Transportation, Handbooks in Operations Research and Management Science, vol. 14 (Elsevier, Amsterdam), 189–284.Google Scholar
  • Minoux M (1989) Networks synthesis and optimum network design problems: Models, solution methods and applications. Networks 19(3):313–360.CrossrefGoogle Scholar
  • Pedersen MB, Crainic TG, Madsen OBG (2009) Models and tabu search metaheuristics for service network design with asset-balance requirements. Transportation Sci. 43(2):158–177.LinkGoogle Scholar
  • Smilowitz, KR, Atamtürk A, Daganzo CF (2003) Deferred item and vehicle routing within integrated networks. Transportation Res. Part E: Logist. Transportation Rev. 39(4):305–323.CrossrefGoogle Scholar
  • Teypaz N, Schrenk S, Cung V-D (2010) A decomposition scheme for large-scale service network design with asset management. Transportation Res. Part E: Logist. Transportation Rev. 46(1):156–170.CrossrefGoogle Scholar
  • Vavasis SA (1991) Nonlinear Optimization: Complexity Issues (Oxford University Press, Oxford, UK).Google Scholar
  • Vu DM, Crainic TG, Toulouse M (2013) A three-phase matheuristic for capacitated multi-commodity fixed-cost network design with design-balance constraints. J. Heuristics 19(5):757–795.CrossrefGoogle Scholar
  • Wang Z, Qi M (2019) Service network design considering multiple types of services. Transportation Res. Part E: Logist. Transportation Rev. 126:1–14.CrossrefGoogle Scholar
  • Wang Z, Qi M, Cheng C, Zhang C (2019) A hybrid algorithm for large-scale service network design considering a heterogeneous fleet. Eur. J. Oper. Res. 276(2):483–494.CrossrefGoogle Scholar
  • Yaghini M, Karimi M, Rahbar M, Sharifitabar MH (2015) A cutting-plane neighborhood structure for fixed-charge capacitated multicommodity network design problem. INFORMS J. Comput. 27:48–58.LinkGoogle Scholar
  • Zeng B, Zhao L (2013) Solving two-stage robust optimization problems using a column-and-constraint generation method. Oper. Res. Lett. 41(5):457–461.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.