IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v232y2021ics0925527320302802.html
   My bibliography  Save this article

An integer programming model and directed Steiner-forest based heuristic for routing less-than-truckload freight

Author

Listed:
  • Tamvada, Srinivas Subramanya
  • Mansouri, Bahareh
  • Hassini, Elkafi
  • Pribytkov, Theodore

Abstract

Less-than-truckload (LTL) freight transportation is a vital part of Canada’s economy, with revenues running into billions of dollars and a cascading impact on many other industries. LTL operators have to deal with large volumes of shipments and uncertainty in demand patterns. In an industry that already has low profit margins, it is therefore vitally important to make good quality routing decisions without expending a lot of time. The optimization of such LTL freight networks results in large scale mathematical programming problems. In this paper, we present a novel Integer Linear Programming (ILP) formulation and heuristics for routing LTL freight. Experiments in collaboration with our industry partner indicate that our proposals can significantly lower routing costs for Canadian LTL operators. In addition, our approach can be useful for generating load plans on larger American LTL networks.

Suggested Citation

  • Tamvada, Srinivas Subramanya & Mansouri, Bahareh & Hassini, Elkafi & Pribytkov, Theodore, 2021. "An integer programming model and directed Steiner-forest based heuristic for routing less-than-truckload freight," International Journal of Production Economics, Elsevier, vol. 232(C).
    • Handle: RePEc:eee:proeco:v:232:y:2021:i:c:s0925527320302802
    DOI: 10.1016/j.ijpe.2020.107925
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527320302802
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2020.107925?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. Warren B. Powell & Ioannis A. Koskosidis, 1992. "Shipment Routing Algorithms with Tree Constraints," Transportation Science, INFORMS, vol. 26(3), pages 230-245, August.
    2. Kathleen Lindsey & Alan Erera & Martin Savelsbergh, 2016. "Improved Integer Programming-Based Neighborhood Search for Less-Than-Truckload Load Plan Design," Transportation Science, INFORMS, vol. 50(4), pages 1360-1379, November.
    3. 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.
    4. Özkaya, Evren & Keskinocak, PInar & Roshan Joseph, V. & Weight, Ryan, 2010. "Estimating and benchmarking Less-than-Truckload market rates," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(5), pages 667-682, September.
    5. Jeffery L. Kennington & Charles D. Nicholson, 2010. "The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 326-337, May.
    6. Margolis, Joshua T. & Sullivan, Kelly M. & Mason, Scott J. & Magagnotti, Mariah, 2018. "A multi-objective optimization model for designing resilient supply chain networks," International Journal of Production Economics, Elsevier, vol. 204(C), pages 174-185.
    7. Warren B. Powell, 1986. "A Local Improvement Heuristic for the Design of Less-than-Truckload Motor Carrier Networks," Transportation Science, INFORMS, vol. 20(4), pages 246-257, November.
    8. 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.
    9. Dulebenets, Maxim A., 2018. "A comprehensive multi-objective optimization model for the vessel scheduling problem in liner shipping," International Journal of Production Economics, Elsevier, vol. 196(C), pages 293-318.
    10. Hernández, Salvador & Peeta, Srinivas & Kalafatas, George, 2011. "A less-than-truckload carrier collaboration planning problem under dynamic capacities," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(6), pages 933-946.
    11. Warren B. Powell & Yosef Sheffi, 1989. "OR Practice—Design and Implementation of an Interactive Optimization System for Network Design in the Motor Carrier Industry," Operations Research, INFORMS, vol. 37(1), pages 12-29, February.
    12. Dulebenets, Maxim A., 2019. "A Delayed Start Parallel Evolutionary Algorithm for just-in-time truck scheduling at a cross-docking facility," International Journal of Production Economics, Elsevier, vol. 212(C), pages 236-258.
    13. Dulebenets, Maxim A. & Ozguven, Eren Erman, 2017. "Vessel scheduling in liner shipping: Modeling transport of perishable assets," International Journal of Production Economics, Elsevier, vol. 184(C), pages 141-156.
    14. Janny M. Y. Leung & Thomas L. Magnanti & Vijay Singhal, 1990. "Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics," Transportation Science, INFORMS, vol. 24(4), pages 245-260, November.
    15. Haass, Rasmus & Dittmer, Patrick & Veigt, Marius & Lütjen, Michael, 2015. "Reducing food losses and carbon emission by using autonomous control – A simulation study of the intelligent container," International Journal of Production Economics, Elsevier, vol. 164(C), pages 400-408.
    16. 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)

    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. 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.
    2. Greening, Lacy M. & Dahan, Mathieu & Erera, Alan L., 2023. "Lead-Time-Constrained Middle-Mile Consolidation Network Design with Fixed Origins and Destinations," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    3. Dulebenets, Maxim A., 2019. "A Delayed Start Parallel Evolutionary Algorithm for just-in-time truck scheduling at a cross-docking facility," International Journal of Production Economics, Elsevier, vol. 212(C), pages 236-258.
    4. Mike Hewitt, 2019. "Enhanced Dynamic Discretization Discovery for the Continuous Time Load Plan Design Problem," Transportation Science, INFORMS, vol. 53(6), pages 1731-1750, November.
    5. 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).
    6. 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.
    7. 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.
    8. 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.
    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. 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.
    11. Eskandarzadeh, Saman & Fahimnia, Behnam, 2024. "Containerised parcel delivery: Modelling and performance evaluation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 186(C).
    12. Du, Jiaoman & Zhou, Jiandong & Li, Xiang & Li, Lei & Guo, Ao, 2021. "Integrated self-driving travel scheme planning," International Journal of Production Economics, Elsevier, vol. 232(C).
    13. Hewitt, Mike & Lehuédé, Fabien, 2023. "New formulations for the Scheduled Service Network Design Problem," Transportation Research Part B: Methodological, Elsevier, vol. 172(C), pages 117-133.
    14. 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.
    15. Lin, Cheng-Chang, 2001. "The freight routing problem of time-definite freight delivery common carriers," Transportation Research Part B: Methodological, Elsevier, vol. 35(6), pages 525-547, July.
    16. 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.
    17. Teodor Gabriel Crainic & Mike Hewitt & Michel Toulouse & Duc Minh Vu, 2018. "Scheduled service network design with resource acquisition and management," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 7(3), pages 277-309, September.
    18. 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.
    19. C S Sung & W Yang, 2008. "An exact algorithm for a cross-docking supply chain network design problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(1), pages 119-136, January.
    20. Maxim A. Dulebenets, 2018. "A Diploid Evolutionary Algorithm for Sustainable Truck Scheduling at a Cross-Docking Facility," Sustainability, MDPI, vol. 10(5), pages 1-23, April.

    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:proeco:v:232:y:2021:i:c:s0925527320302802. 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/ijpe .

    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.