Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time Service Network Design Problem

References

• 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.Google Scholar
• Crainic T (2000) Service network design in freight transportation. Eur. J. Oper. Res. 122(2):272–288.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
• Hosseininasab A (2015) The continuous time service network design problem. Unpublished doctoral dissertation, University of Waterloo, Waterloo, ON, Canada.Google Scholar
• Magnanti TL, Wong RT (1984) Network design and transportation planning: Models and algorithms. Transportation Sci. 18(1):1–55.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