Incorporating Holding Costs in Continuous-Time Service Network Design: New Model, Relaxation, and Exact Algorithm

References

• Andersen J, Crainic TG, Christiansen M (2009a) Service network design with asset management: Formulations and comparative analyses. Transportation Res. Part C Emerging Tech. 17(2):197–207.Crossref, Google Scholar
• Andersen J, Crainic TG, Christiansen M (2009b) Service network design with management and coordination of multiple fleets. Eur. J. Oper. Res. 193(2):377–389.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
• Belieres S (2019) Mathematical programming for tactical transportation planning in a multi-product supply chain, PhD thesis, automatic control engineering, INSA de Toulouse, Toulouse, France.Google Scholar
• Boland NL, Savelsbergh MW (2019) Perspectives on integer programming for time-dependent models. TOP 27:147–173.Crossref, Google Scholar
• Boland N, Kalinowski T, Kaur S (2015) Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: Bounds and solution strategies. Comput. Oper. Res. 64:113–129.Crossref, Google Scholar
• Boland N, Hewitt M, Marshall L, Savelsbergh M (2017) The continuous-time service network design problem. Oper. Res. 65(5):1303–1321.Link, Google Scholar
• Boland N, Hewitt M, Marshall L, Savelsbergh M (2019) The price of discretizing time: A study in service network design. Eur. J. Transportation Logist. 8(2):195–216.Crossref, Google Scholar
• Bookbinder JH, Higginson JK (2002) Probabilistic modeling of freight consolidation by private carriage. Transportation Res. Part E Logist. Transportation Rev. 38(5):305–318.Crossref, Google Scholar
• Chinneck JW (1997) Finding a useful subset of constraints for analysis in an infeasible linear program. INFORMS J. Comput. 9(2):164–174.Link, Google Scholar
• Chinneck JW, Dravnieks EW (1991) Locating minimal infeasible constraint sets in linear programs. ORSA J. Comput. 3(2):157–168.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 J-M (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, 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
• Crainic TG, Hewitt M, Toulouse M, Vu DM (2014) Service network design with resource constraints. Transportation Sci. 50(4):1380–1393.Link, Google Scholar
• Crainic TG, Hewitt M, Toulouse M, Vu DM (2018) Scheduled service network design with resource acquisition and management. Eur. J. Transportation Logist. 7(3):277–309.Crossref, 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
• Farvolden JM, Powell WB (1994) Subgradient methods for the service network design problem. Transportation Sci. 28(3):256–272.Link, Google Scholar
• Fleischer L, Skutella M (2007) Quickest flows over time. SIAM J. Comput. 36(6):1600–1630.Crossref, 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 (Centre for Research on Transportation, Springer, Boston), 1–19.Crossref, 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
• Gleeson J, Ryan J (1990) Identifying minimally infeasible subsystems of inequalities. ORSA J. Comput. 2(1):61–63.Link, Google Scholar
• Groß M, Skutella M (2012) Maximum multicommodity flows over time without intermediate storage. Eur. Sympos. Algorithms (Springer, Berlin, Heidelberg), 539–550.Google Scholar
• Hewitt M (2019) Enhanced dynamic discretization discovery for the continuous time load plan design problem. Transportation Sci. 53(6):1731–1750.Link, Google Scholar
• Hewitt M (2022) The flexible scheduled service network design problem. Transportation Sci. 56(4):1000–1021.Link, Google Scholar
• Hosseininasab A (2015) The continuous time service network design problem. Master’s thesis, University of Waterloo, Waterloo, ON.Google Scholar
• Hu W, Toriello A, Dessouky M (2018) Integrated inventory routing and freight consolidation for perishable goods. Eur. J. Oper. Res. 271(2):548–560.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
• Lagos F, Boland N, Savelsbergh M (2020) The continuous-time inventory-routing problem. Transportation Sci. 54(2):375–399.Link, Google Scholar
• Marshall L, Boland N, Savelsbergh M, Hewitt M (2021) Interval-based dynamic discretization discovery for solving the continuous-time service network design problem. Transportation Sci. 55(1):29–51.Link, Google Scholar
• Medina J, Hewitt M, Lehuédé F, Péton O (2019) Integrating long-haul and local transportation planning: The service network design and routing problem. Eur. J. Transportation Logist. 8(2):119–145.Crossref, Google Scholar
• Pedersen MB, Crainic TG, Madsen OB (2009) Models and tabu search metaheuristics for service network design with asset-balance requirements. Transportation Sci. 43(2):158–177.Link, Google Scholar
• Rudi A, Fröhling M, Zimmer K, Schultmann F (2016) Freight transportation planning considering carbon emissions and in-transit holding costs: A capacitated multi-commodity network flow model. Eur. J. Transportation Logist. 5(2):123–160.Crossref, Google Scholar
• Skutella M (2009) An introduction to network flows over time. Cook W, Lovász L, Vygen J, eds. Research Trends in Combinatorial Optimization (Springer, Berlin, Heidelberg), 451–482.Crossref, Google Scholar
• Tyan JC, Wang F-K, Du TC (2003) An evaluation of freight consolidation policies in global third party logistics. Omega 31(1):55–62.Crossref, Google Scholar
• Ülkü MA (2009a), Analysis of shipment consolidation in the logistics supply chain. PhD thesis, University of Waterloo, Waterloo, ON.Google Scholar
• Ülkü MA (2009b) Comparison of typical shipment consolidation programs: Structural results. Management Sci. Engrg. 3(4):27–33.Google Scholar
• Van Loon J (1981) Irreducibly inconsistent systems of linear inequalities. Eur. J. Oper. Res. 8(3):283–288.Crossref, Google Scholar
• Vu DM, Hewitt M, Boland N, Savelsbergh M (2020) Dynamic discretization discovery for solving the time-dependent traveling salesman problem with time windows. Transportation Sci. 54(3):703–720.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