Optimization of Truck–Cargo Online Matching for the Less-Than-Truck-Load Logistics Hub under Real-Time Demand

Weilin Tang, Xinghan Chen, Maoxiang Lang (), Shiqi Li, Yuying Liu and Wenyu Li
Additional contact information
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
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
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
Shiqi Li: China North Artificial Intelligence & Innovation Research Institute, Beijing 100072, 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
Wenyu Li: Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China

Mathematics, 2024, vol. 12, issue 5, 1-31

Abstract: Reasonable matching of capacity resources and transported cargoes is the key to realizing intelligent scheduling of less-than-truck-load (LTL) logistics. In practice, there are many types and numbers of participating objects involved in LTL logistics, such as customers, orders, trucks, unitized implements, etc. This results in a complex and large number of matching schemes where truck assignments interact with customer order service sequencing. For the truck–cargo online matching problem under real-time demand, it is necessary to comprehensively consider the online matching process of multi-node orders and the scheduling of multi-types of trucks. Combined with the actual operation scenario, a mixed-integer nonlinear programming model is introduced, and an online matching algorithm with a double-layer nested time window is designed to solve it. By solving the model in a small numerical case using Gurobi and the online matching algorithm, the validity of the model and the effectiveness of the algorithm are verified. The results indicate that the online matching algorithm can obtain optimization results with a lower gap while outperforming in terms of computation time. Relying on the realistic large-scale case for empirical analysis, the optimization results in a significant reduction in the number of trips for smaller types of trucks, and the average truck loading efficiency has reached close to 95%. The experimental results demonstrate the general applicability and effectiveness of the algorithm. Thus, it helps to realize the on-demand allocation of capacity resources and the timely response of transportation scheduling of LTL logistics hubs.

Keywords: LTL logistics; truck–cargo matching; truck scheduling; real-time demand; online algorithm (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/5/755/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/5/755/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:5:p:755-:d:1350361

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().