Optimization of Truck–Cargo Online Matching for the Less-Than-Truck-Load Logistics Hub under Real-Time Demand
Mathematics · 02.03.2024 · 12 (5) · 755
DOI: 10.3390/math12050755 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics, online erschienen am 02.03.2024. Verfasst von Weilin Tang und 5 weiteren Autor:innen. Die Arbeit wurde bisher 16-mal zitiert (Crossref) und nennt 36 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Key Research and Development Program of China.
Abstract (Originalsprache)
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.
Förderung
- National Key Research and Development Program of China
Zitieren
APA
Tang, W., Chen, X., Lang, M., Li, S., Liu, Y., & Li, W. (2024). Optimization of Truck–Cargo Online Matching for the Less-Than-Truck-Load Logistics Hub under Real-Time Demand. Mathematics, 12(5), 755. https://doi.org/10.3390/math12050755
Vancouver
Tang W, Chen X, Lang M, Li S, Liu Y, Li W. Optimization of Truck–Cargo Online Matching for the Less-Than-Truck-Load Logistics Hub under Real-Time Demand. Mathematics. 2024;12(5):755. doi:10.3390/math12050755
BibTeX
@article{Tang2024,
author = {Tang, Weilin and Chen, Xinghan and Lang, Maoxiang and Li, Shiqi and Liu, Yuying and Li, Wenyu},
title = {Optimization of Truck–Cargo Online Matching for the Less-Than-Truck-Load Logistics Hub under Real-Time Demand},
journal = {Mathematics},
year = {2024},
volume = {12},
number = {5},
pages = {755},
doi = {10.3390/math12050755}
}
EUVIMED