Machine Learning Applications for Delivery Time Prediction and Freight Planning

The rapid advancement of technology has a profound impact on logistics and freight transportation. Efficient management of transportation schedules is vital for businesses seeking to minimize costs, reduce delivery delays, and improve customer satisfaction. One of the most important challenges in this field is the Vehicle Routing Problem with Time Windows (VRPTW), which requires not only finding optimal delivery routes but also adhering to specific timing constraints for each customer or delivery point. Traditional optimization methods often struggle with the complexity and dynamic nature of real-world logistics, particularly when dealing with large-scale datasets and unpredictable factors such as traffic congestion or weather conditions. To address these limitations, this study introduces a machine learning-based system that enhances the performance of existing VRPTW solutions. Unlike conventional approaches that rely solely on heuristics or static planning, our system employs modern machine learning models to predict key time-related parameters – including transit time, availability time, and service time – based on historical and contextual data. These predictive capabilities allow the routing algorithms to make more informed decisions, resulting in more accurate and adaptable scheduling. Building on previous research involving Random Forest models, we propose a more robust framework that incorporates advanced preprocessing techniques and feature engineering to improve model accuracy. By training and evaluating the system using real-world datasets, we are able to simulate practical scenarios and validate the effectiveness of our approach. Experimental results show that our proposed method consistently outperforms other commonly used machine learning models in terms of Mean Absolute Error (MAE), thus confirming its potential for real-world applications. Overall, this study contributes a scalable and intelligent solution to a longstanding logistics problem, paving the way for more responsive and cost-effective transportation systems.

Authors

Institutions

Publication Details

Journal
Informatics and Automation
Published
2025-10-08
DOI
https://doi.org/10.15622/ia.24.5.5
Citations
2
Primary Topic
Vehicle Routing Optimization Methods
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Machine Learning Applications for Delivery Time Prediction and Freight Planning

Nguyen Duc Tan, Cong Doan Truong, Nguyễn Việt Hùng, Nguyen Nam-Hoang et al.
2 citations
Informatics and Automation
Vehicle Routing Optimization Methods
2.48
article

Machine Learning Applications for Delivery Time Prediction and Freight Planning

Nguyen Duc Tan, Cong Doan Truong, Nguyễn Việt Hùng, Nguyen Nam-Hoang, Trinh Thu Huong
article en
2 citations

Abstract

The rapid advancement of technology has a profound impact on logistics and freight transportation. Efficient management of transportation schedules is vital for businesses seeking to minimize costs, reduce delivery delays, and improve customer satisfaction. One of the most important challenges in this field is the Vehicle Routing Problem with Time Windows (VRPTW), which requires not only finding optimal delivery routes but also adhering to specific timing constraints for each customer or delivery point. Traditional optimization methods often struggle with the complexity and dynamic nature of real-world logistics, particularly when dealing with large-scale datasets and unpredictable factors such as traffic congestion or weather conditions. To address these limitations, this study introduces a machine learning-based system that enhances the performance of existing VRPTW solutions. Unlike conventional approaches that rely solely on heuristics or static planning, our system employs modern machine learning models to predict key time-related parameters – including transit time, availability time, and service time – based on historical and contextual data. These predictive capabilities allow the routing algorithms to make more informed decisions, resulting in more accurate and adaptable scheduling. Building on previous research involving Random Forest models, we propose a more robust framework that incorporates advanced preprocessing techniques and feature engineering to improve model accuracy. By training and evaluating the system using real-world datasets, we are able to simulate practical scenarios and validate the effectiveness of our approach. Experimental results show that our proposed method consistently outperforms other commonly used machine learning models in terms of Mean Absolute Error (MAE), thus confirming its potential for real-world applications. Overall, this study contributes a scalable and intelligent solution to a longstanding logistics problem, paving the way for more responsive and cost-effective transportation systems.

Informatics and AutomationVol. 24(5)
Vietnam National University, Hanoi (VN)
Openalex Percentile: Top 9%
Vehicle Routing Optimization Methods
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.