IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i21p3336-d1505923.html
   My bibliography  Save this article

Optimization of Truck–Cargo Matching for the LTL Logistics Hub Based on Three-Dimensional Pallet Loading

Author

Listed:
  • Xinghan Chen

    (Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China)

  • Weilin Tang

    (Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China)

  • Yuzhilin Hai

    (Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China)

  • Maoxiang Lang

    (Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China)

  • Yuying Liu

    (Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China)

  • Shiqi Li

    (Collective Intelligence & Collaboration Laboratory, China North Artificial Intelligence & Innovation Research Institute, Beijing 100072, China)

Abstract

This study investigates the truck–cargo matching problem in less-than-truckload (LTL) logistics hubs, focusing on optimizing the three-dimensional loading of goods onto standardized pallets and assigning these loaded pallets to a fleet of heterogeneous vehicles. A two-stage hybrid heuristic algorithm is proposed to solve this complex logistics challenge. In the first stage, a tree search algorithm based on residual space is developed to determine the optimal layout for the 3D loading of cargo onto pallets. In the second stage, a heuristic online truck–cargo matching algorithm is introduced to allocate loaded pallets to trucks while optimizing the number of trucks used and minimizing transportation costs. The algorithm operates within a rolling time horizon, allowing it to dynamically handle real-time order arrivals and time window constraints. Numerical experiments demonstrate that the proposed method achieves high pallet loading efficiency (close to 90%), near-optimal truck utilization (nearly 95%), and significant cost reductions, making it a practical solution for real-world LTL logistics operations.

Suggested Citation

  • Xinghan Chen & Weilin Tang & Yuzhilin Hai & Maoxiang Lang & Yuying Liu & Shiqi Li, 2024. "Optimization of Truck–Cargo Matching for the LTL Logistics Hub Based on Three-Dimensional Pallet Loading," Mathematics, MDPI, vol. 12(21), pages 1-29, October.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:21:p:3336-:d:1505923
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/21/3336/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/21/3336/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:12:y:2024:i:21:p:3336-:d:1505923. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.