Cutting-Plane Matheuristic for Service Network Design with Design-Balanced Requirements

References

• Andersen J, Crainic TG, Christiansen M (2009a) Service network design with management and coordination of multiple fleets. Eur. J. Oper. Res. 193(2):377–389.Crossref, Google Scholar
• Andersen J, Crainic TG, Christiansen M (2009b) Service network design with asset management: Formulations and comparative analyses. Transportation Res. Part C 17(2):197–207.Crossref, Google 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.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
• Atamtürk A (2001) Flow pack facets of the single node fixed-charge flow polytope. Oper. Res. Lett. 29(3):107–114.Crossref, Google Scholar
• Balakrishnan A, Magnanti TL, Mirchandani PB (1997) Network design. Dell’Amico M, Maffioli F, Martello S, eds. Annotated Bibliographies in Combinatorial Optimization (John Wiley & Sons, New York), 311–334.Google Scholar
• Balas E (1975) Facets of the knapsack polytope. Math. Programming 8(1):146–164.Crossref, Google Scholar
• Bektaş T, Crainic TG (2008) A brief overview of intermodal transportation. Taylor G, ed. Logistics Engineering Handbook (Taylor and Francis Group, Boca Raton, FL), 1–16.Google Scholar
• Chouman M, Crainic TG, Gendron B (2009) A cutting-plane algorithm for multicommodity capacitated fixed charge network design. Technical report, Center for Research on Transportation, Université de Montréal, Montréal.Google Scholar
• Chouman M, Crainic TG, Gendron B (2011) Commodity representations and cutset-based inequalities for multicommodity capacitated fixed charge network design. Technical report CIRRELT-2011-56, Centre Interuniversitaire de Recherche sur Les Réseaux d’Entreprise, La Logistique et Les Transports, Université de Montréal, Montréal.Google Scholar
• Crainic TG (2000) Service network design in freight transportation. Eur. J. Oper. Res. 122(2):272–288.Crossref, Google Scholar
• Crainic TG (2003) Long-haul freight transportation. Hall RW, ed. Handbook of Transportation Science, 2nd ed. (Kluwer Academic Publishers, Norwell, MA), 451–516.Crossref, Google Scholar
• Crainic TG, Kim K (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
• Crainic TG, Frangioni A, Gendron B (1999) Multicommodity capacitated network design. Soriano P, Sanso B, eds. Telecommunications Network Planning (Kluwer Academic Publishers, Norwell, MA), 1–19.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–3):73–99.Crossref, Google Scholar
• Gendron B, Crainic TG (1994) Relaxations for multicommodity capacitated network design problems. Technical report, Publication CRT-945, Centre de Recherche sur Les Transports, Université de Montréal, Montréal.Google Scholar
• Ghamlouche I, Crainic TG, Gendreau M (2003) Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. Oper. Res. 51(4):655–667.Link, Google Scholar
• Lai MF, Lo HK (2004) Ferry service network design: Optimal fleet size, routing and scheduling. Transportation Res. Part A 38(4):305–328.Google Scholar
• Magnanti TL, Wong RT (1984) Network design and transportation planning: Models and algorithms. Transportation Sci. 18(1):1–55.Link, Google Scholar
• Minoux M (1989) Network synthesis and optimum network design problems: Models, solution methods and applications. Networks 19(3):313–360.Crossref, Google 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.Link, Google Scholar
• Smilowitz KR, Atamtürk A, Daganzo CF (2003) Deferred item and vehicle routing within integrated networks. Transportation Res. Part E 39(4):305–323.Crossref, Google Scholar
• Stallaert J (1997) The complementary class of generalized flow cover inequalities. Discrete Appl. Math. 77(1):73–80.Crossref, Google Scholar
• Vu DM, Crainic TG, Toulouse M (2012) A three-stage matheuristic for the capacitated multi-commodity fixed-cost network design with design-balance constraints. Technical report CIRRELT-2012-21, Centre Interuniversitaire de Recherche sur Les Réseaux d’Entreprise, La Logistique et Les Transports, Université de Montréal, Montréal.Google Scholar
• Wolsey L (1975) Faces of linear inequalities in 0–1 variables. Math. Programming 8(1):165–178.Crossref, Google Scholar