IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v301y2022i3p1021-1034.html
   My bibliography  Save this article

Near real-time loadplan adjustments for less-than-truckload carriers

Author

Listed:
  • Herszterg, Ian
  • Ridouane, Yassine
  • Boland, Natashia
  • Erera, Alan
  • Savelsbergh, Martin

Abstract

We design and implement decision support technology to assist dispatchers in the daily management of loadplans in less-than-truckload service networks. The freight volume that enters a service network on the day of operations deviates from the forecast freight volume used to create the loadplan. These deviations cause inefficiencies when the capacity on planned freight paths is no longer sufficient and delays result in missed service promises. Near real-time loadplan adjustments, i.e., rerouting freight on alternate paths, can improve on-time performance without incurring additional cost (e.g., without purchasing additional capacity). The problem of identifying effective alternate freight paths is modeled on a time-expanded network and computationally efficient heuristics are developed for its solution in order to ensure that there is sufficient time to put the adjusted loadplan in place. We demonstrate the practical viability and value of these heuristics in a computational study using real-life data from a large LTL carrier. The results show that on-time performance can be improved without increasing cost, i.e., by rerouting freight and using existing capacity in the service network.

Suggested Citation

  • Herszterg, Ian & Ridouane, Yassine & Boland, Natashia & Erera, Alan & Savelsbergh, Martin, 2022. "Near real-time loadplan adjustments for less-than-truckload carriers," European Journal of Operational Research, Elsevier, vol. 301(3), pages 1021-1034.
  • Handle: RePEc:eee:ejores:v:301:y:2022:i:3:p:1021-1034
    DOI: 10.1016/j.ejor.2021.11.044
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221721009954
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2021.11.044?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Alan Erera & Michael Hewitt & Martin Savelsbergh & Yang Zhang, 2013. "Improved Load Plan Design Through Integer Programming Based Local Search," Transportation Science, INFORMS, vol. 47(3), pages 412-427, August.
    2. Ilfat Ghamlouche & Teodor Crainic & Michel Gendreau, 2004. "Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design," Annals of Operations Research, Springer, vol. 131(1), pages 109-133, October.
    3. Rothenbächer, Ann-Kathrin & Drexl, Michael & Irnich, Stefan, 2016. "Branch-and-price-and-cut for a service network design and hub location problem," European Journal of Operational Research, Elsevier, vol. 255(3), pages 935-947.
    4. Barcos, L. & Rodríguez, V. & Álvarez, M.J. & Robusté, F., 2010. "Routing design for less-than-truckload motor carriers using Ant Colony Optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(3), pages 367-383, May.
    5. Warren B. Powell & Arun Marar & Jack Gelfand & Steve Bowers, 2002. "Implementing Real-Time Optimization Models: A Case Application From The Motor Carrier Industry," Operations Research, INFORMS, vol. 50(4), pages 571-581, August.
    6. Crainic, Teodor Gabriel & Laporte, Gilbert, 1997. "Planning models for freight transportation," European Journal of Operational Research, Elsevier, vol. 97(3), pages 409-438, March.
    7. Raymond K. Cheung & B. Muralidharan, 2000. "Dynamic Routing for Priority Shipments in LTL Service Networks," Transportation Science, INFORMS, vol. 34(1), pages 86-98, February.
    8. Teodor Gabriel Crainic & Michel Gendreau & Judith M. Farvolden, 2000. "A Simplex-Based Tabu Search Method for Capacitated Network Design," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 223-236, August.
    9. Crainic, Teodor Gabriel, 2000. "Service network design in freight transportation," European Journal of Operational Research, Elsevier, vol. 122(2), pages 272-288, April.
    10. R.K. Cheung & B. Muralidharan, 1999. "Impact of dynamic decision making on hub‐and‐spoke freight transportationnetworks," Annals of Operations Research, Springer, vol. 87(0), pages 49-71, April.
    11. Judith M. Farvolden & Warren B. Powell, 1994. "Subgradient Methods for the Service Network Design Problem," Transportation Science, INFORMS, vol. 28(3), pages 256-272, August.
    12. Ahmad Baubaid & Natashia Boland & Martin Savelsbergh, 2021. "The Value of Limited Flexibility in Service Network Designs," Transportation Science, INFORMS, vol. 55(1), pages 52-74, 1-2.
    13. Ahmad I. Jarrah & Ellis Johnson & Lucas C. Neubert, 2009. "Large-Scale, Less-than-Truckload Service Network Design," Operations Research, INFORMS, vol. 57(3), pages 609-625, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Weilin Tang & Xinghan Chen & Maoxiang Lang & Shiqi Li & Yuying Liu & Wenyu Li, 2024. "Optimization of Truck–Cargo Online Matching for the Less-Than-Truck-Load Logistics Hub under Real-Time Demand," Mathematics, MDPI, vol. 12(5), pages 1-31, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Satici, Ozgur & Dayarian, Iman, 2024. "Tactical and operational planning of express intra-city package services," Omega, Elsevier, vol. 122(C).
    2. Ahmad Baubaid & Natashia Boland & Martin Savelsbergh, 2021. "The Value of Limited Flexibility in Service Network Designs," Transportation Science, INFORMS, vol. 55(1), pages 52-74, 1-2.
    3. Anne Lange & Werner Delfmann, 2017. "Network concentration indices for less-than-truckload transportation," Transportation, Springer, vol. 44(6), pages 1475-1497, November.
    4. Al Hajj Hassan, Lama & Hewitt, Mike & Mahmassani, Hani S., 2022. "Daily load planning under different autonomous truck deployment scenarios," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).
    5. Alan Erera & Michael Hewitt & Martin Savelsbergh & Yang Zhang, 2013. "Improved Load Plan Design Through Integer Programming Based Local Search," Transportation Science, INFORMS, vol. 47(3), pages 412-427, August.
    6. Dall'Orto, Leonardo Campo & Crainic, Teodor Gabriel & Leal, Jose Eugenio & Powell, Warren B., 2006. "The single-node dynamic service scheduling and dispatching problem," European Journal of Operational Research, Elsevier, vol. 170(1), pages 1-23, April.
    7. Dayarian, Iman & Rocco, Adolfo & Erera, Alan & Savelsbergh, Martin, 2022. "Operations design for high-velocity intra-city package service," Transportation Research Part B: Methodological, Elsevier, vol. 161(C), pages 150-168.
    8. G. Guastaroba & M. G. Speranza & D. Vigo, 2016. "Intermediate Facilities in Freight Transportation Planning: A Survey," Transportation Science, INFORMS, vol. 50(3), pages 763-789, August.
    9. Ahmad I. Jarrah & Ellis Johnson & Lucas C. Neubert, 2009. "Large-Scale, Less-than-Truckload Service Network Design," Operations Research, INFORMS, vol. 57(3), pages 609-625, June.
    10. Natashia Boland & Mike Hewitt & Luke Marshall & Martin Savelsbergh, 2017. "The Continuous-Time Service Network Design Problem," Operations Research, INFORMS, vol. 65(5), pages 1303-1321, October.
    11. C S Sung & S H Song, 2003. "Integrated service network design for a cross-docking supply chain network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(12), pages 1283-1295, December.
    12. Michael F. Gorman & John-Paul Clarke & Amir Hossein Gharehgozli & Michael Hewitt & René de Koster & Debjit Roy, 2014. "State of the Practice: A Review of the Application of OR/MS in Freight Transportation," Interfaces, INFORMS, vol. 44(6), pages 535-554, December.
    13. Grunert, Tore & Sebastian, Hans-Jurgen, 2000. "Planning models for long-haul operations of postal and express shipment companies," European Journal of Operational Research, Elsevier, vol. 122(2), pages 289-309, April.
    14. Li, Xiangyong & Wei, Kai & Aneja, Y.P. & Tian, Peng, 2017. "Design-balanced capacitated multicommodity network design with heterogeneous assets," Omega, Elsevier, vol. 67(C), pages 145-159.
    15. Hewitt, Mike & Crainic, Teodor Gabriel & Nowak, Maciek & Rei, Walter, 2019. "Scheduled service network design with resource acquisition and management under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 324-343.
    16. Xin Wang & Teodor Gabriel Crainic & Stein W. Wallace, 2019. "Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 153-170, February.
    17. Cassiano A. Isler & Yesid Asaff & Marin Marinov, 2020. "Designing a Geo-Strategic Railway Freight Network in Brazil Using GIS," Sustainability, MDPI, vol. 13(1), pages 1-21, December.
    18. Tobias Harks & Felix G. König & Jannik Matuschke & Alexander T. Richter & Jens Schulz, 2016. "An Integrated Approach to Tactical Transportation Planning in Logistics Networks," Transportation Science, INFORMS, vol. 50(2), pages 439-460, May.
    19. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar & Mohammad Hassan Sharifitabar, 2015. "A Cutting-Plane Neighborhood Structure for Fixed-Charge Capacitated Multicommodity Network Design Problem," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 48-58, February.
    20. Lai, M. F. & Lo, Hong K., 2004. "Ferry service network design: optimal fleet size, routing, and scheduling," Transportation Research Part A: Policy and Practice, Elsevier, vol. 38(4), pages 305-328, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:301:y:2022:i:3:p:1021-1034. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.