Efficient Logistics Path Optimization and Scheduling Using Deep Reinforcement Learning and Convolutional Neural Networks

With the rapid development of e-commerce and online shopping, the logistics industry is facing unprecedented challenges. Traditional logistics path - planning methods, such as SPA, HA, GA, etc., struggle to cope with the complex and ever-changing logistics environment. To address this issue, this study proposes an innovative model that combines Deep reinforcement learning (DRL) with a Convolutional neural network (CNN) to achieve efficient logistics path optimization. In this research, a detailed analysis and pre-processing of the public datasets, the City Logistics Dataset (CLDS) and the Traffic Status Dataset (TSDS), were carried out to construct a model capable of effectively handling diverse logistics environments. Six baseline methods, namely the classic shortest path algorithm (SPA), heuristic algorithm (HA), genetic algorithm (GA), rule-based method (RBM), traditional deep reinforcement learning method (TDRM), and the most advanced deep learning method (ADLM), were selected for comparison. The experimental results indicate that the proposed model performs excellently across various environments. For instance, in suburban areas, it achieves a path length of 180 kilometers, a completion time of 120 minutes, a punctuality rate of 92%, and a dispatch success rate of 95%. In urban settings, the path length is 200 kilometers, the completion time is 150 minutes, the punctuality rate is 90%, and the dispatch success rate is 93%. On highways, it reaches a path length of 170 kilometers, a completion time of 110 minutes, a punctuality rate of 93%, and a dispatch success rate of 95%. Compared with the baseline methods, the model shows significant improvements in key metrics such as path length, completion time, punctuality, and dispatch success rate. Additionally, it outperforms them in terms of computation time and robustness scores, demonstrating great potential for practical applications.

Authors

Publication Details

Journal
Informatica
Published
2025-03-11
DOI
https://doi.org/10.31449/inf.v49i16.7839
Citations
1
Primary Topic
Advanced Manufacturing and Logistics Optimization
Type
article
Field-Weighted Citation Impact
1.24
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient Logistics Path Optimization and Scheduling Using Deep Reinforcement Learning and Convolutional Neural Networks

Yan Yang, Kang Wang
1 citations
Informatica
Advanced Manufacturing and Logistics Optimization
1.24
article

Efficient Logistics Path Optimization and Scheduling Using Deep Reinforcement Learning and Convolutional Neural Networks

Yan Yang, Kang Wang
article en
1 citations

Abstract

With the rapid development of e-commerce and online shopping, the logistics industry is facing unprecedented challenges. Traditional logistics path - planning methods, such as SPA, HA, GA, etc., struggle to cope with the complex and ever-changing logistics environment. To address this issue, this study proposes an innovative model that combines Deep reinforcement learning (DRL) with a Convolutional neural network (CNN) to achieve efficient logistics path optimization. In this research, a detailed analysis and pre-processing of the public datasets, the City Logistics Dataset (CLDS) and the Traffic Status Dataset (TSDS), were carried out to construct a model capable of effectively handling diverse logistics environments. Six baseline methods, namely the classic shortest path algorithm (SPA), heuristic algorithm (HA), genetic algorithm (GA), rule-based method (RBM), traditional deep reinforcement learning method (TDRM), and the most advanced deep learning method (ADLM), were selected for comparison. The experimental results indicate that the proposed model performs excellently across various environments. For instance, in suburban areas, it achieves a path length of 180 kilometers, a completion time of 120 minutes, a punctuality rate of 92%, and a dispatch success rate of 95%. In urban settings, the path length is 200 kilometers, the completion time is 150 minutes, the punctuality rate is 90%, and the dispatch success rate is 93%. On highways, it reaches a path length of 170 kilometers, a completion time of 110 minutes, a punctuality rate of 93%, and a dispatch success rate of 95%. Compared with the baseline methods, the model shows significant improvements in key metrics such as path length, completion time, punctuality, and dispatch success rate. Additionally, it outperforms them in terms of computation time and robustness scores, demonstrating great potential for practical applications.

InformaticaVol. 49(16)
Openalex Percentile: Top 21%
Advanced Manufacturing and Logistics Optimization
1.24
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.