Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 13, 2026

Available Issues

April 10, 2013 - May 13, 2026

The Value of Limited Flexibility in Service Network Designs

Published Online:5 Oct 2020https://doi.org/10.1287/trsc.2020.1009

References

  • Agarwal R, Ergun Ö (2008) Ship scheduling and network design for cargo routing in liner shipping. Transportation Sci. 42(2):175–196.Link, Google Scholar
  • Armacost AP, Barnhart C, Ware KA (2002) Composite variable formulations for express shipment service network design. Transportation Sci. 36(1):1–20.Link, Google Scholar
  • Armacost AP, Barnhart C, Ware KA, Wilson AM (2004) UPS optimizes its air network. Interfaces 34(1):15–25.Link, Google Scholar
  • Atamtürk A (2002) On capacitated network design cut-set polyhedra. Math. Programming Ser. B 92(3):425–437.Crossref, Google Scholar
  • Bai R, Wallace SW, Li J, Chong AYL (2014) Stochastic service network design with rerouting. Transportation Res. Part B: Methodological 60:50–65.Crossref, Google Scholar
  • Barahona F (1996) Network design using cut inequalities. SIAM J. Optim. 6(3):823–837.Crossref, Google Scholar
  • Barnhart C, Schneur RR (1996) Air network design for express shipment service. Oper. Res. 44(6):852–863.Link, Google Scholar
  • Barnhart C, Jin H, Vance PH (2000) Railroad blocking: A network design application. Oper. Res. 48(4):603–614.Link, Google Scholar
  • Barnhart C, Krishnan N, Kim D, Ware K (2002) Network design for express shipment delivery. Comput. Optim. Appl. 21(3):239–262.Crossref, Google Scholar
  • Bienstock D, Chopra S, Günlük O, Tsai CY (1998) Minimum cost capacity installation for multicommodity network flows. Math. Programming 81(2):177–199.Crossref, Google Scholar
  • Chouman M, Crainic TG, Gendron B (2017) Commodity representations and cutset-based inequalities for multicommodity capacitated fixed-charge network design. Transportation Sci. 51(2):650–667.Link, Google Scholar
  • Christiansen M, Fagerholt K, Ronen D (2004) Ship routing and scheduling: Status and perspectives. Transportation Sci. 38(1):1–18.Link, Google Scholar
  • Crainic TG (2000) Service network design in freight transportation. Eur. J. Oper. Res. 122(2):272–288.Crossref, Google Scholar
  • Crainic TG, Rousseau JM (1986) Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem. Transportation Res. Part B: Methodological 20(3):225–242.Crossref, Google Scholar
  • Crainic TG, Roy J (1988) OR tools for tactical freight transportation planning. Eur. J. Oper. Res. 33(3):290–297.Crossref, Google Scholar
  • Crainic TG, Gendreau M, Farvolden JM (2000) A simplex-based tabu search method for capacitated network design. INFORMS J. Comput. 12(3):223–236.Link, Google Scholar
  • Crainic TG, Gendron B, Hernu G (2004) A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design. J. Heuristics 10(5):525–545.Crossref, Google Scholar
  • Crainic TG, Fu X, Gendreau M, Rei W, Wallace SW (2011) Progressive hedging-based meta-heuristics for stochastic network design. Networks 58(2):114–124.Crossref, Google Scholar
  • Erera A, Hewitt M, Savelsbergh M, Zhang Y (2013) Improved load plan design through integer programming based local search. Transportation Sci. 47(3):412–427.Link, Google Scholar
  • Frangioni A, Gendron B (2009) 0-1 reformulations of the multicommodity capacitated network design problem. Discrete Appl. Math. 157(6):1229–1241.Crossref, Google Scholar
  • Gendron B, Crainic TG, Frangioni A (1999) Multicommodity capacitated network design. Sansò B, Soriano P, eds. Telecommunications Network Planning (Springer, Boston), 1–19.Crossref, Google Scholar
  • Ghamlouche I, Crainic TG, Gendreau M (2003) Cycle-based neighborhoods for fixed-charge capacitated multicommodity network design. Oper. Res. 51(4):655–667.Link, Google Scholar
  • Ghamlouche I, Crainic TG, Gendreau M (2004) Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design. Ann. Oper. Res. 131(1–4):109–133.Crossref, Google Scholar
  • Grünert T, Sebastian HJ (2000) Planning models for long-haul operations of postal and express shipment companies. Eur. J. Oper. Res. 122(2):289–309.Crossref, Google Scholar
  • Guastaroba G, Speranza MG, Vigo D (2016) Intermediate facilities in freight transportation planning: A survey. Transportation Sci. 50(3):763–789.Link, Google Scholar
  • Günlük O (1999) A branch-and-cut algorithm for capacitated network design problems. Math. Programming 86(1):17–39.Crossref, Google Scholar
  • Hoff A, Lium AG, Løkketangen A, Crainic TG (2010) A metaheuristic for stochastic service network design. J. Heuristics 16(5):653–679.Crossref, Google Scholar
  • Inghels D, Dullaert W, Vigo D (2016) A service network design model for multimodal municipal solid waste transport. Eur. J. Oper. Res. 254(1):68–79.Crossref, Google Scholar
  • Jarrah AI, Johnson E, Neubert LC (2009) Large-scale, less-than-truckload service network design. Oper. Res. 57(3):609–625.Link, Google Scholar
  • Jordan WC, Graves SC (1995) Principles on the benefits of manufacturing process flexibility. Management Sci. 41(4):577–594.Link, Google Scholar
  • Kim D, Pardalos PM (1999) A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett. 24(4):195–203.Crossref, Google Scholar
  • Kim D, Barnhart C, Ware K, Reinhardt G (1999) Multimodal express package delivery: A service network design application. Transportation Sci. 33(4):391–407.Link, Google Scholar
  • Kleywegt AJ, Shapiro A, Homem-de-Mello T (2002) The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2):479–502.Crossref, Google Scholar
  • Lin CC (2001) The freight routing problem of time-definite freight delivery common carriers. Transportation Res. Part B: Methodological 35(6):525–547.Crossref, Google Scholar
  • Lin CC (2004) Load planning with uncertain demands for time-definite freight common carriers. Transportation Res. Record J. Transportation Res. Board 1873(1):17–24.Crossref, Google Scholar
  • Lin CC, Lin JSJ (2007) The multistage stochastic integer load planning problem. Transportation Res. Part E: Logist. Transportation Rev. 43(2):143–156.Crossref, Google Scholar
  • Lindsey K, Erera A, Savelsbergh M (2016) Improved integer programming-based neighborhood search for less-than-truckload load plan design. Transportation Sci. 50(4):1360–1379.Link, Google Scholar
  • Lium AG, Crainic TG, Wallace SW (2009) A study of demand stochasticity in service network design. Transportation Sci. 43(2):144–157.Link, Google Scholar
  • Lulli G, Pietropaoli U, Ricciardi N (2011) Service network design for freight railway transportation: The Italian case. J. Oper. Res. Soc. 62(12):2107–2119.Crossref, Google Scholar
  • Magnanti TL, Wong RT (1984) Network design and transportation planning models and algorithms. Transportation Sci. 18(1):1–55.Link, Google Scholar
  • Newton HN, Vance PH, Barnhart C (1998) Constructing blocking plan to minimize handling costs. Transportation Sci. 32(4):330–345.Link, Google Scholar
  • Nozick LK, Morlok EK (1997) A model for medium-term operations planning in an intermodal rail-truck service. Transportation Res. Part A: Policy Practice 31(2):91–107.Crossref, Google Scholar
  • Powell WB (1986) A local improvement heuristic for the design of less-than-truckload motor carrier networks. Transportation Sci. 20(4):246–257.Link, Google Scholar
  • Powell WB, Koskosidis IA (1992) Shipment routing algorithms with tree constraints. Transportation Sci. 26(3):230–245.Link, Google Scholar
  • Powell WB, Sheffi Y (1983) The load planning problem of motor carriers: Problem description and a proposed solution approach. Transportation Res. Part A: Policy Practice 17(6):471–480.Crossref, Google Scholar
  • Powell WB, Sheffi Y (1989) OR practice—Design and implementation of an interactive optimization system for network design in the motor carrier industry. Oper. Res. 37(1):12–29.Link, Google Scholar
  • Raack C, Koster AM, Orlowski S, Wessäly R (2011) On cut-based inequalities for capacitated network design polyhedra. Networks 57(2):141–156.Crossref, Google Scholar
  • Reinhardt LB, Pisinger D (2012) A branch and cut algorithm for the container shipping network design problem. Flexible Services Manufacturing J. 24(3):349–374.Crossref, Google Scholar
  • Sun C, Wallace SW, Luo L (2017) Stochastic multi-commodity network design: The quality of deterministic solutions. Oper. Res. Lett. 45(3):266–268.Crossref, Google Scholar
  • Wang X, Wallace SW (2016) Stochastic scheduled service network design in the presence of a spot market for excess capacity. Eur. J. Transportation Logist. 5(4):393–413.Crossref, Google Scholar
  • Wang X, Crainic TG, Wallace SW (2019) Stochastic network design for planning scheduled transportation services: The value of deterministic solutions. INFORMS J. Comput. 31(1):153–170.Link, Google Scholar
  • Wang Z, Qi M (2020) Robust service network design under demand uncertainty. Transportation Sci. 54(3):676–689.Link, Google Scholar
  • Wieberneit N (2008) Service network design for freight transportation: A review. OR Spectrum 30(1):77–112.Crossref, Google Scholar
  • Yamada T, Russ BF, Castro J, Taniguchi E (2009) Designing multimodal freight transport networks: A heuristic approach and applications. Transportation Sci. 43(2):129–143.Link, Google Scholar
  • Zhu E, Crainic TG, Gendreau M (2014) Scheduled service network design for freight rail transportation. Oper. Res. 62(2):383–400.Link, Google Scholar
Previous
Back to Top
Next
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.
Agree