The Continuous-Time Service Network Design Problem

References

• 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.Link, Google Scholar
• Anderson EJ, Nash P (1987) Linear Programming in Infinite-Dimensional Spaces: Theory and Applications (John Wiley & Sons, New York).Google Scholar
• Anderson E, Nash P, Philpott A (1982) A class of continuous network flow subproblems. Math. Oper. Res. 7(4):501–514.Link, Google Scholar
• Baumann N, Skutella M (2006) Solving evacuation problems efficiently—Earliest arrival flows with multiple sources. Proc. 47th Annual IEEE Sympos. Foundation Comp. Sci., FOCS ’06 (IEEE Computer Society, Washington, DC), 399–410.Crossref, Google Scholar
• Burkard RE, Dlaska K, Klinz B (1993) The quickest flow problem. Zeitschrift für Oper. Res. 37(1):31–58.Google Scholar
• Crainic T (2000) Service network design in freight transportation. Eur. J. Oper. Res. 122(2):272–288.Crossref, Google Scholar
• Crainic TG, Frangioni A, Gendron B (2001) Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discrete Appl. Math. 112(1):73–99.Crossref, Google Scholar
• Crainic T, 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, Hewitt M, Toulouse M, Vu DM (2016) Service network design with resource constraints. Transportation Sci. 50(4):1380–1393.Link, Google Scholar
• Dash S, Günlük O, Lodi A, Tramontani A (2012) A time bucket formulation for the traveling salesman problem with time windows. INFORMS J. Comput. 24(1):132–147.Link, 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
• Fischer F, Helmberg C (2014) Dynamic graph generation for the shortest path problem in time expanded networks. Math. Programming 143(1):257–297.Crossref, Google Scholar
• Fleischer L, Skutella M (2003) Minimum cost flows over time without intermediate storage. Proc. 14th Annual ACM-SIAM Sympos. Discrete Algorithms, SODA ’03 (SIAM, Philadelphia), 66–75.Google Scholar
• Fleischer L, Skutella M (2007) Quickest flows over time. SIAM J. Comput. 36(6):1600–1630.Crossref, Google Scholar
• Ford LR, Fulkerson DR (1958) Constructing maximal dynamic flows from static flows. Oper. Res. 6(3):419–433.Link, Google Scholar
• Ford LR, Fulkerson DR (1962) Flows in Networks (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• Gale D (1958) Transient flows in networks. Technical report, Defense Technical Information Center, Fort Belvoir, VA.Google Scholar
• Ghamlouch I, Crainic T, Gendreau M (2003) Cycle-based neighborhoods for fixed charge capacitated multicommodity network design. Oper. Res. 51(4):655–667.Link, Google Scholar
• Ghamlouch I, Crainic T, Gendreau M (2004) Path relinking, cycle-based neighborhoods and capacitated multicommodity network design. Ann. Oper. Res. 131(1):109–133.Crossref, Google Scholar
• Groß M, Skutella M (2012) Maximum multicommodity flows over time without intermediate storage. Epstein L, Ferragina P, eds. Algorithms—ESA 2012: Proc. 20th Annual Eur. Sympos. (Springer, Berlin), 539–550.Crossref, Google Scholar
• Groß M, Kappmeier JPW, Schmidt DR, Schmidt M (2012) Approximating earliest arrival flows in arbitrary networks. Epstein L, Ferragina P, eds. Algorithms—ESA 2012: Proc. 20th Annual Eur. Sympos. (Springer, Berlin), 551–562.Crossref, Google Scholar
• Hall A, Hippler S, Skutella M (2007) Multicommodity flows over time: Efficient algorithms and complexity. Theoret. Comput. Sci. 379(3):387–404.Crossref, Google Scholar
• Hewitt M, Nemhauser G, Savelsbergh M (2010) Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem. INFORMS J. Comput. 22(2):314–325.Link, Google Scholar
• Hewitt M, Nemhauser G, Savelsbergh MW (2013) Branch-and-price guided search for integer programs with an application to the multicommodity fixed-charge network flow problem. INFORMS J. Comput. 25(2):302–316.Link, Google Scholar
• Hoppe B, Tardos É (1994) Polynomial time algorithms for some evacuation problems. Sleator DD, ed. Proc. Fifth Annual ACM-SIAM Sympos. Discrete Algorithms, SODA ’94 (SIAM, Philadelphia), 433–441.Google Scholar
• Hoppe B, Tardos É (2000) The quickest transshipment problem. Math. Oper. Res. 25(1):36–62.Link, Google Scholar
• Jarrah A, Johnson E, Neubert L (2009) Large-scale, less-than-truckload service network design. Oper. Res. 57(3):609–625.Link, Google Scholar
• Jarvis JJ, Ratliff HD (1982) Some equivalent objectives for dynamic network flow problems. Management Sci. 28(1):106–109.Link, Google Scholar
• Katayama N, Chen M, Kubo M (2009) A capacity scaling heuristic for the multicommodity capacitated network design problem. J. Comput. Appl. Math. 232(1):90–101.Crossref, Google Scholar
• Kennington JL, Nicholson CD (2010) The uncapacitated time-space fixed-charge network flow problem: an empirical investigation of procedures for arc capacity assignment. INFORMS J. Comput. 22(2):326–337.Link, Google Scholar
• Klinz B, Woeginger GJ (2004) Minimum-cost dynamic flows: The series-parallel case. Networks 43(3):153–162.Crossref, Google Scholar
• Megiddo N (1974) Optimal flows in networks with multiple sources and sinks. Math. Programming 7(1):97–107.Crossref, Google Scholar
• Minieka E (1973) Maximal, lexicographic, and dynamic network flows. Oper. Res. 21(2):517–527.Link, Google Scholar
• Powell WB, Jaillet P, Odoni A (1995) Stochastic and dynamic networks and routing. Ball MO, Magnanti TL, Monma CL, Nemhauser GL, eds. Handbooks in Operations Research and Management Science, Vol. 8 (Elsevier, Amsterdam), 141–295.Google Scholar
• Savelsbergh M (1986) Local search for routing problems with time windows. Ann. Oper. Res. 4(1):285–305.Crossref, Google Scholar
• Schulz JD (2014) 2014 state of logistics: Less-than-truckload’s welcomed rebound. Logistics Management (July 1), http://www.logisticsmgmt.com/article/state_of_logistics_less_than_truckloads_welcomed_rebound.Google Scholar
• Skutella M (2009) An introduction to network flows over time. Cook WJ, Lovász L, Vygen J, eds. Research Trends in Combinatorial Optimization (Springer, Berlin), 451–482.Crossref, Google Scholar
• Tjandra SA (2003) Dynamic network optimization with application to the evacuation problem. PhD thesis, Universitat Kaiserslautern, Kaiserslautern, Germany.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
• Wang X, Regan AC (2002) Local truckload pickup and delivery with hard time window constraints. Transportation Res. Part B: Methodological 36(2):97–112.Crossref, Google Scholar
• Wang X, Regan AC (2009) On the convergence of a new time window discretization method for the traveling salesman problem with time window constraints. Comput. Indust. Engrg. 56(1):161–164.Crossref, Google Scholar
• Wieberneit N (2008) Service network design for freight transportation: A review. OR Spectrum 30(1):77–112.Crossref, Google Scholar
• Yaghini M, Rahbar M, Karimi M (2012) A hybrid simulated annealing and column generation approach for capacitated multicommodity network design. J. Oper. Res. Soc. 64(7):1010–1020.Crossref, Google Scholar