Enhanced Dynamic Discretization Discovery for the Continuous Time Load Plan Design Problem
Published Online:1 Aug 2019https://doi.org/10.1287/trsc.2019.0890
References
- (1997) Introduction to Linear Optimization, Athena Scientific Series in Optimization and Neural Computation, vol. 6 (Athena Scientific, Belmont, MA).Google Scholar
- (1997) Introduction to Stochastic Programming (Springer, Berlin).Google Scholar
- (2017) The continuous-time service network design problem. Oper. Res. 65(5):1303–1321.Link, Google Scholar
- (2018) The price of discretizing time: A study in service network design. EURO J. Transportation Logist., ePub ahead of print March 6, https://doi.org/10.1007/s13676-018-0119-x.Google Scholar
- (2000) Service network design in freight transportation. Eur. J. Oper. Res. 122(2):272–288.Crossref, Google Scholar
- (2001) Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discrete Appl. Math. 112(1):73–99.Crossref, Google Scholar
- (2014) Service network design with resource constraints. Transportation Sci. 50(4):1380–1393.Link, Google Scholar
- (2013a) Improved load plan design through integer programming based local search. Transportation Sci. 47(3):412–427.Link, Google Scholar
- (2013b) Creating schedules and computing operating costs for LTL load plans. Comput. Oper. Res. 40(3):691–702.Crossref, Google Scholar
- (1958) Constructing maximal dynamic flows from static flows. Oper. Res. 6(3):419–433.Link, Google Scholar
- (1962) Flows in Networks (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
- IBM (2013) Users manual—Version 12, release 6. IBM, Armonk, NY.Google Scholar
- (2009) Large-scale, less-than-truckload service network design. Oper. Res. 57(3):609–625.Link, Google Scholar
- (2016) Improved integer programming-based neighborhood search for less-than-truckload load plan design. Transportation Sci. 50(4):1360–1379.Link, Google Scholar
- (2010) Symmetry in integer linear programming. Jünger M et al., eds. 50 Years of Integer Programming 1958-2008 (Springer, Berlin), 647–686.Crossref, Google Scholar
- (1977) A modified benders’ partitioning algorithm for mixed integer programming. Management Sci. 24(3):312–319.Link, Google Scholar
- (1988) Integer and Combinatorial Optimization (Wiley-Interscience, New York).Crossref, 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
- (1994) Subgradient methods for the service network design problem. Transportation Sci. 28(3):256–272.Link, Google Scholar
- (1986) A local improvement heuristic for the design of less-than-truckload motor carrier networks. Transportation Sci. 20(4):246–257.Link, Google Scholar
- (1983) The load planning problem of motor carriers: Problem description and proposed solution approach. Transportation Res. Part A: General 17(6):471–480.Crossref, Google Scholar
- (1989) Design and implementation of an interactive optimization system for network design in the motor carrier industry. Oper. Res. 37(1):12–29.Link, Google Scholar
- (2017) How did operating margins of less-than-truckload carriers stack up? Accessed March 18, 2018, https://marketrealist.com/2017/09/how-did-operating-margins-of-less-than-truckload-carriers-stack-up.Google Scholar
- (2016) The benders decomposition algorithm: A literature review. Eur. J. Oper. Res. 259(3):801–817.Crossref, Google Scholar
- (2017) 2017 state of logistics: Less-than-truckload (LTL). Logistics Management (July 11), Accessed March 18, 2018, https://www.logisticsmgmt.com/article/2017_state_of_logistics_less_than_truckload_ltl.Google Scholar
- (2014) Vehicle Routing: Problems, Methods, and Applications (SIAM, Philadelphia).Crossref, Google Scholar
- (2008) Service network design for freight transportation: A review. OR Spectrum 30(1):77–112.Crossref, Google Scholar
- (2014) Scheduled service network design for freight rail transportation. Oper. Res. 62(2):383–400.Link, Google Scholar

