IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v339y2024i1d10.1007_s10479-024-05876-y.html
   My bibliography  Save this article

The third party logistics provider freight management problem: a framework and deep reinforcement learning approach

Author

Listed:
  • Amin Abbasi-Pooya

    (University of Kansas)

  • Michael T. Lash

    (University of Kansas)

Abstract

In many large manufacturing companies, freight management is handled by a third-party logistics (3PL) provider, thus allowing manufacturers and their suppliers to focus on the production of goods rather than managing their delivery. Provided their pivotal supply chain role, in this work we propose a general framework for what we term as “the 3PL freight management problem” (3PLFMP). Our framework identifies three primary activities involved in 3PL freight management: the assignment of orders to a fleet of vehicles, efficient routing of the fleet, and packing the assigned orders in vehicles. Furthermore, we provide a specific instantiation of the 3PLFMP that considers direct vs. consolidated shipping strategies, one dimensional packing constraints, and a fixed vehicle routing schedule. We solve this instantiated problem using several Reinforcement Learning (RL) methods, including Q-learning, Double Q-learning, SARSA, Deep Q-learning, and Double Deep Q-learning, comparing against two benchmark methods, a simulated annealing heuristic and a variable neighborhood descent algorithm. We evaluate the performance of these methods on two datasets. One is fully simulated and based on past work, while another is semi-simulated using real-world automobile manufacturers and part supplier locations, and is of our own design. We find that RL methods vastly outperform the benchmark heuristic methods on both datasets, thus establishing the superiority of RL methods in solving this highly complicated and stochastic problem.

Suggested Citation

  • Amin Abbasi-Pooya & Michael T. Lash, 2024. "The third party logistics provider freight management problem: a framework and deep reinforcement learning approach," Annals of Operations Research, Springer, vol. 339(1), pages 965-1024, August.
  • Handle: RePEc:spr:annopr:v:339:y:2024:i:1:d:10.1007_s10479-024-05876-y
    DOI: 10.1007/s10479-024-05876-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-024-05876-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10479-024-05876-y?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. Bortfeldt, Andreas & Yi, Junmin, 2020. "The Split Delivery Vehicle Routing Problem with three-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 282(2), pages 545-558.
    2. Ashok Kumar & Leroy B. Schwarz & James E. Ward, 1995. "Risk-Pooling Along a Fixed Delivery Route Using a Dynamic Inventory-Allocation Policy," Management Science, INFORMS, vol. 41(2), pages 344-362, February.
    3. Rosario Paradiso & Roberto Roberti & Demetrio Laganá & Wout Dullaert, 2020. "An Exact Solution Framework for Multitrip Vehicle-Routing Problems with Time Windows," Operations Research, INFORMS, vol. 68(1), pages 180-198, January.
    4. Xiangyi Zhang & Lu Chen & Michel Gendreau & André Langevin, 2022. "Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1419-1436, May.
    5. Zhang, Zhenzhen & Che, Yuxin & Liang, Zhe, 2024. "Split-demand multi-trip vehicle routing problem with simultaneous pickup and delivery in airport baggage transit," European Journal of Operational Research, Elsevier, vol. 312(3), pages 996-1010.
    6. Satır, Benhür & Erenay, Fatih Safa & Bookbinder, James H., 2018. "Shipment consolidation with two demand classes: Rationing the dispatch capacity," European Journal of Operational Research, Elsevier, vol. 270(1), pages 171-184.
    7. Nicholas D. Kullman & Aurelien Froger & Jorge E. Mendoza & Justin C. Goodson, 2021. "frvcpy: An Open-Source Solver for the Fixed Route Vehicle Charging Problem," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1277-1283, October.
    8. Dan O. Bausch & Gerald G. Brown & David Ronen, 1995. "Consolidating and Dispatching Truck Shipments of Mobil Heavy Petroleum Products," Interfaces, INFORMS, vol. 25(2), pages 1-17, April.
    9. Lijun Wei & Zhixing Luo, & Roberto Baldacci & Andrew Lim, 2020. "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 428-443, April.
    10. Jean-François Côté & Mohamed Haouari & Manuel Iori, 2021. "Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 963-978, July.
    11. Anirudh Subramanyam & Panagiotis P. Repoussis & Chrysanthos E. Gounaris, 2020. "Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 661-681, July.
    12. Cortes, Juan David & Suzuki, Yoshinori, 2020. "Vehicle Routing with Shipment Consolidation," International Journal of Production Economics, Elsevier, vol. 227(C).
    13. Liao, Chung-Shou & Lu, Shang-Hung & Shen, Zuo-Jun Max, 2016. "The electric vehicle touring problem," Transportation Research Part B: Methodological, Elsevier, vol. 86(C), pages 163-180.
    14. Jorge E. Mendoza & Louis-Martin Rousseau & Juan G. Villegas, 2016. "A hybrid metaheuristic for the vehicle routing problem with stochastic demand and duration constraints," Journal of Heuristics, Springer, vol. 22(4), pages 539-566, August.
    15. Jorge Oyola & Halvard Arntzen & David L. Woodruff, 2018. "The stochastic vehicle routing problem, a literature review, part I: models," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 7(3), pages 193-221, September.
    16. Sıla Çetinkaya & Halit Üster & Gopalakrishnan Easwaran & Burcu Baris Keskin, 2009. "An Integrated Outbound Logistics Model for Frito-Lay: Coordinating Aggregate-Level Production and Distribution Decisions," Interfaces, INFORMS, vol. 39(5), pages 460-475, October.
    17. Qin, Hu & Zhang, Zizhen & Qi, Zhuxuan & Lim, Andrew, 2014. "The freight consolidation and containerization problem," European Journal of Operational Research, Elsevier, vol. 234(1), pages 37-48.
    18. Kfir Arviv & Helman Stern & Yael Edan, 2016. "Collaborative reinforcement learning for a two-robot job transfer flow-shop scheduling problem," International Journal of Production Research, Taylor & Francis Journals, vol. 54(4), pages 1196-1209, February.
    19. Mauro Dell'Amico & José Carlos Díaz Díaz & Manuel Iori, 2012. "The Bin Packing Problem with Precedence Constraints," Operations Research, INFORMS, vol. 60(6), pages 1491-1504, December.
    20. M Wen & J Larsen & J Clausen & J-F Cordeau & G Laporte, 2009. "Vehicle routing with cross-docking," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(12), pages 1708-1718, December.
    21. Hanne Pollaris & Kris Braekers & An Caris & Gerrit K. Janssens & Sabine Limbourg, 2016. "Capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 5(2), pages 231-255, June.
    22. Haiqing Song & Vernon N. Hsu & Raymond K. Cheung, 2008. "Distribution Coordination Between Suppliers and Customers with a Consolidation Center," Operations Research, INFORMS, vol. 56(5), pages 1264-1277, October.
    23. Flavio Molina & Reinaldo Morabito & Silvio Alexandre de Araujo, 2016. "MIP models for production lot sizing problems with distribution costs and cargo arrangement," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(11), pages 1395-1407, November.
    24. Haouari, Mohamed & Mhiri, Mariem, 2024. "Lower and upper bounding procedures for the bin packing problem with concave loading cost," European Journal of Operational Research, Elsevier, vol. 312(1), pages 56-69.
    25. Nguyen, Christine & Dessouky, Maged & Toriello, Alejandro, 2014. "Consolidation strategies for the delivery of perishable products," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 69(C), pages 108-121.
    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. Nguyen, Christine & Dessouky, Maged & Toriello, Alejandro, 2014. "Consolidation strategies for the delivery of perishable products," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 69(C), pages 108-121.
    2. Mathijs Barkel & Maxence Delorme, 2023. "Arcflow Formulations and Constraint Generation Frameworks for the Two Bar Charts Packing Problem," INFORMS Journal on Computing, INFORMS, vol. 35(2), pages 475-494, March.
    3. Reusken, Meike & Laporte, Gilbert & Rohmer, Sonja U.K. & Cruijssen, Frans, 2024. "Vehicle routing with stochastic demand, service and waiting times — The case of food bank collection problems," European Journal of Operational Research, Elsevier, vol. 317(1), pages 111-127.
    4. Ferreira, Kamyla Maria & de Queiroz, Thiago Alves & Munari, Pedro & Toledo, Franklina Maria Bragion, 2024. "A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery," European Journal of Operational Research, Elsevier, vol. 316(2), pages 597-616.
    5. Alexandre M. Florio & Richard F. Hartl & Stefan Minner & Juan-José Salazar-González, 2021. "A Branch-and-Price Algorithm for the Vehicle Routing Problem with Stochastic Demands and Probabilistic Duration Constraints," Transportation Science, INFORMS, vol. 55(1), pages 122-138, 1-2.
    6. Peng, Xiaoshuai & Zhang, Lele & Thompson, Russell G. & Wang, Kangzhou, 2023. "A three-phase heuristic for last-mile delivery with spatial-temporal consolidation and delivery options," International Journal of Production Economics, Elsevier, vol. 266(C).
    7. Romero-Silva, Rodrigo & Mujica Mota, Miguel, 2022. "Trade-offs in the landside operations of air cargo hubs: Horizontal cooperation and shipment consolidation policies considering capacitated nodes," Journal of Air Transport Management, Elsevier, vol. 103(C).
    8. Lixin Tang & Feng Li & Zhi-Long Chen, 2019. "Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms," INFORMS Journal on Computing, INFORMS, vol. 31(3), pages 493-514, July.
    9. Ji, Bin & Zhang, Zheng & Yu, Samson S. & Zhou, Saiqi & Wu, Guohua, 2023. "Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1219-1235.
    10. Hanbazazah, Abdulkader S. & Abril, Luis & Erkoc, Murat & Shaikh, Nazrul, 2019. "Freight consolidation with divisible shipments, delivery time windows, and piecewise transportation costs," European Journal of Operational Research, Elsevier, vol. 276(1), pages 187-201.
    11. Wang, Min & Zhao, Lindu & Herty, Michael, 2019. "Joint replenishment and carbon trading in fresh food supply chains," European Journal of Operational Research, Elsevier, vol. 277(2), pages 561-573.
    12. 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.
    13. Jie Zhang & Yifan Zhu & Xiaobo Li & Mengjun Ming & Weiping Wang & Tao Wang, 2022. "Multi-Trip Time-Dependent Vehicle Routing Problem with Split Delivery," Mathematics, MDPI, vol. 10(19), pages 1-24, September.
    14. De La Vega, Jonathan & Gendreau, Michel & Morabito, Reinaldo & Munari, Pedro & Ordóñez, Fernando, 2023. "An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands," European Journal of Operational Research, Elsevier, vol. 308(2), pages 676-695.
    15. Zhang, Yuankai & Sun, Lijun & Hu, Xiangpei & Zhao, Chen, 2019. "Order consolidation for the last-mile split delivery in online retailing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 122(C), pages 309-327.
    16. Ekici, Ali, 2023. "A large neighborhood search algorithm and lower bounds for the variable-Sized bin packing problem with conflicts," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1007-1020.
    17. Ponce, Diego & Contreras, Ivan & Laporte, Gilbert, 2020. "E-commerce shipping through a third-party supply chain," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    18. François V. Louveaux & Juan-José Salazar-González, 2018. "Exact Approach for the Vehicle Routing Problem with Stochastic Demands and Preventive Returns," Service Science, INFORMS, vol. 52(6), pages 1463-1478, December.
    19. Mutlu, Fatih & Çetinkaya, Sıla, 2020. "Supplier–carrier–buyer channels: Contractual pricing for a carrier serving a supplier–buyer partnership," International Journal of Production Economics, Elsevier, vol. 230(C).
    20. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.

    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:spr:annopr:v:339:y:2024:i:1:d:10.1007_s10479-024-05876-y. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.