Service Network Design with Resource Constraints
Published Online:2 Jul 2014https://doi.org/10.1287/trsc.2014.0525
References
- (1993) Network Flows: Theory, Algorithms, and Applications (Prentice Hall, Upper Saddle River, NJ).Google Scholar
- (2009) Designing new European rail freight services. J. Oper. Res. Soc. 60(3):348–360.Crossref, Google Scholar
- (2009a) Service network design with asset management: Formulations and comparative analyses. Transportation Res. Part C 17(2):197–207.Crossref, Google Scholar
- (2009b) Service network design with management and coordination of multiple fleets. Eur. J. Oper. Res. 193(2):377–389.Crossref, Google Scholar
- (2011) Branch and price for service network design with asset management constraints. Transportation Sci. 45(1):33–49.Link, Google Scholar
- (2008) An optimization-based heuristic for the split delivery vehicle routing problem. Transportation Sci. 42(1):22–31.Link, Google Scholar
- (1996) Air network design for express shipment service. Oper. Res. 44(6):852–863.Link, Google Scholar
- (1998) Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3):316–329.Link, Google Scholar
- (2008) A brief overview of intermodal transportation. Taylor GD, ed. Logistics Engineering Handbook, (Taylor and Francis Group, Boca Raton, FL), 1–16.Google Scholar
- (2015) Cutting-plane matheuristic for service network design with design-balanced requirements. Transportation Sci. 50(4):99–113.Link, Google Scholar
- (2007) Maritime transportation. Barnhart C, Laporte G, eds. Transportation, Handbooks in Operations Research and Management Science, Vol. 14 (North-Holland, Amsterdam), 189–284.Google Scholar
- (1998) A survey of optimization models for train routing and scheduling. Transportation Sci. 32(4):380–404.Link, Google Scholar
- (2000) Service network design in freight transportation. Eur. J. Oper. Res. 122(2):272–288.Crossref, Google Scholar
- (2003) Long-haul freight transportation. Hall RW, ed. Handbook of Transportation Science, 2nd ed. (Kluwer Academic Publishers, Norwell, MA), 451–516.Crossref, Google Scholar
- (2007) Intermodal transportation. Barnhart C, Laporte G, eds. Transportation, Handbooks in Operations Research and Management Science, Vol. 14 (North-Holland, Amsterdam), 467–537.Google Scholar
- (1997) Planning models for freight transportation. Eur. J. Oper. Res. 97(3):409–438.Crossref, Google Scholar
- (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
- (2006) A new ILP-based refinement heuristic for vehicle routing problems. Math. Programming B 105(2–3):471–499.Crossref, Google Scholar
- Desaulniers G, Desrosiers J, Solomon MM, eds. (2005) Column Generation (Springer-Verlag, New York).Crossref, Google Scholar
- (2013) Improved load plan design through integer programming based local search. Transportation Sci. 47(3):417–427.Link, Google Scholar
- (1997) Tabu Search (Kluwer Academic Publishers, Norwell, MA).Crossref, Google Scholar
- (2010) Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem. INFORMS J. Comput. 22(2):314–325.Link, Google Scholar
- (1999) A solution to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett. 24(4):195–203.Crossref, Google Scholar
- (1999) Multimodal express package delivery: A service network design application. Transportation Sci. 33(4):391–407.Link, Google Scholar
- (2004) Ferry service network design: Optimal fleet size, routing, and scheduling. Transportation Res. Part A 38(4):305–328.Google Scholar
- (2009) Models and tabu search metaheuristics for service network design with asset-balance requirements. Transportation Sci. 43(2):158–177.Link, Google Scholar
- (2003) Deferred item and vehicle routing within integrated networks. Transportation Res. Part E 39(4):305–323.Crossref, Google Scholar
- (2013) A three-phase matheuristic for capacitated multi-commodity fixed-cost network design with design-balance constraints. J. Heuristics 19(5):757–795.Crossref, Google Scholar
- (1971) Finding the k shortest loopless paths in a network. Management Sci. 17(11):712–716.Link, Google Scholar

