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

Guardado en:

Detalles Bibliográficos
Publicado en:	Informatica vol. 49, no. 16 (Mar 2025), p. 151-171
Autor principal:	Yang, Yan
Otros Autores:	Wang, Kang
Publicado:	Slovenian Society Informatika / Slovensko drustvo Informatika
Materias:	Urban environments Deep learning Success Traffic Suburban areas Artificial neural networks Machine learning Electronic commerce Heuristic methods Efficiency Mathematical programming Scheduling Datasets Geography Genetic algorithms Shortest-path problems Artificial intelligence Planning Neural networks Decision making Optimization Supply chains Linear programming Logistics Completion time Traveling salesman problem Optimization algorithms
Acceso en línea:	Citation/Abstract Full Text Full Text - PDF
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Descripción
Resumen:	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.
ISSN:	0350-5596 1854-3871
DOI:	10.31449/inf.v49116.7839
Fuente:	Advanced Technologies & Aerospace Database