The Dynamic Freight Routing Problem for Less-Than-Truckload Carriers

References

• Baubaid A, Boland N, Savelsbergh M (2021) The value of limited flexibility in service network designs. Transportation Sci. 55(1):52–74.Link, Google Scholar
• Cheung R, Muralidharan B (1999) Impact of dynamic decision making on hub-and-spoke freight transportation networks. Annals Oper. Res. 87:49–71.Crossref, Google Scholar
• Cheung RK, Muralidharan B (2000) Dynamic routing for priority shipments in LTL service networks. Transportation Sci. 34(1):86–98.Link, Google Scholar
• Crainic TG (2000) Service network design in freight transportation. Eur. J. Oper. Res. 122(2):272–288.Crossref, Google Scholar
• Dall’Orto LC, Crainic TG, Leal JE, Powell WB (2006) The single-node dynamic service scheduling and dispatching problem. Eur. J. Oper. Res. 170(1):1–23.Crossref, Google Scholar
• Erera A, Karacik B, Savelsbergh M (2008) A dynamic driver management scheme for less-than-truckload carriers. Comput. Oper. Res. 35(11):3397–3411.Crossref, Google Scholar
• Erera A, Hewitt M, Savelsbergh M, Zhang Y (2013a) Improved load plan design through integer programming based local search. Transportation Sci. 47(3):412–427.Link, Google Scholar
• Erera AL, Hewitt M, Savelsbergh MWP, Zhang Y (2013b) Creating schedules and computing operating costs for LTL load plans. Comput. Oper. Res. 40(3):691–702.Crossref, Google Scholar
• Hejazi B, Haghani A (2007) Dynamic decision making for less-than-truckload trucking operations. Transportation Res. Rec. 2032(1):17–25.Crossref, Google Scholar
• Herszterg I, Ridouane Y, Boland N, Erera A, Savelsbergh M (2022) Near real-time loadplan adjustments for less-than-truckload carriers. Eur. J. Oper. Res. 301(3):1021–1034.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
• Kleywegt AJ, Papastavrou JD (1998) Acceptance and dispatching policies for a distribution problem. Transportation Sci. 32(2):127–141.Link, Google Scholar
• Kokonendji CC, Zocchi SS (2010) Extensions of discrete triangular distributions and boundary bias in kernel estimation for discrete functions. Statist. Probability Lett. 80(21):1655–1662.Crossref, Google Scholar
• Lindsey K, Erera A, Savelsbergh M (2016) Improved integer programming-based neighborhood search for less-than-truckload load plan design. Transportation Sci. 50(4):1360–1379.Link, Google Scholar
• Powell WB (1986) A local improvement heuristic for the design of less-than-truckload motor carrier networks. Transportation Sci. 20(4):246–257.Link, Google Scholar
• Powell WB (2003) Dynamic models of transportation operations. Handbooks in Operations Research and Management Science, vol. 11 (Elsevier, New York), 677–756.Google Scholar
• Powell WB (2011) Approximate Dynamic Programming: Solving the Curses of Dimensionality. Wiley Series in Probability and Statistics, 2nd ed. (Wiley, Hoboken, NJ).Crossref, Google Scholar
• Powell WB, Koskosidis IA (1992) Shipment routing algorithms with tree constraints. Transportation Sci. 26(3):230–245.Link, Google Scholar
• Powell WB, Sheffi Y (1983) The load planning problem of motor carriers: Problem description and a proposed solution approach. Transportation Res. Part A: General 17(6):471–480.Crossref, Google Scholar
• Powell WB, Sheffi Y (1989) OR practice—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
• Powell WB, Jaillet P, Odoni A (1995) Stochastic and dynamic networks and routing. Handbooks in Operations Research and Management Science, vol. 8 of Network Routing (Elsevier, New York), 141–295.Google Scholar
• Powell WB, Shapiro JA, Simão HP (2002) An adaptive dynamic programming algorithm for the heterogeneous resource allocation problem. Transportation Sci. 36(2):231–249.Link, Google Scholar
• Powell WB, Simao HP, Bouzaiene-Ayari B (2012) Approximate dynamic programming in transportation and logistics: A unified framework. EURO J. Transportation Logist. 1(3):237–284.Crossref, Google Scholar
• Puterman ML (2005) Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley Series in Probability and Statistics (Wiley, Hoboken, NJ).Google Scholar
• Riis JO (1965) Discounted Markov programming in a periodic process. Oper. Res. 13(6):920–929.Link, Google Scholar
• Shi N, Cheung RK, Xu H, Lai KK (2011) An adaptive routing strategy for freight transportation networks. J. Oper. Res. Soc. 62(4):799–805.Crossref, Google Scholar
• Simão HP, Powell WB (2019) Decomposition methods for dynamic load planning and driver management in LTL trucking. Proc. 7th INFORMS Transportation Sci. and Logist. Soc. Workshop. https://tslworkshop2019.univie.ac.at/fileadmin/user_upload/k_tslworkshop2019/TSL2019_bookofabstracts.pdf.Google Scholar
• Topaloglu H, Powell WB (2006) Dynamic-programming approximations for stochastic time-staged integer multicommodity-flow problems. INFORMS J. Comput. 18(1):31–42.Link, Google Scholar
• Toriello A, Nemhauser G, Savelsbergh M (2010) Decomposing inventory routing problems with approximate value functions. Naval Res. Logist. 57(8):718–727.Crossref, Google Scholar
• Ulmer MW, Thomas BW (2019) Meso-parametric value function approximation for dynamic customer acceptances in delivery routing. Eur. J. Oper. Res. 285(1):183–195.Crossref, Google Scholar
• Ulmer MW, Mattfeld DC, Köster F (2017) Budgeting time for dynamic vehicle routing with stochastic customer requests. Transportation Sci. 52(1):20–37.Link, Google Scholar
• van Heeswijk W, Mes M, Schutten M (2015) An approximate dynamic programming approach to urban freight distribution with batch arrivals. Corman F, Voß S, Negenborn RR, eds. Computational Logistics, vol. 9335 of Lecture Notes in Computer Science (Springer International Publishing, Cham, Switzerland), 61–75.Crossref, Google Scholar
• van Heeswijk WJA, Mes MRK, Schutten JMJ (2019) The delivery dispatching problem with time windows for urban consolidation centers. Transportation Sci. 53(1):203–221.Link, Google Scholar
• Veugen LMM, van der Wal J, Wessels J (1983) The numerical exploitation of periodicity in Markov decision processes. Oper. Res. Spektrum 5(2):97–103.Crossref, Google Scholar
• Wieberneit N (2008) Service network design for freight transportation: A review. OR Spectrum 30(1):77–112.Crossref, Google Scholar