This paper discusses and provides solutions for three different logistic use cases involving external truck network design and proposes that in future research, DRL algorithms for vehicle routing problems could be generalized into more variations of VRP.
Abstract
As an important component of the supply chain industry, transportation has experienced rapid development in the past decade with the assistance of digital platforms and intelligent algorithms. Within the field of transportation research, Vehicle Routing Problem (VRP) has remained a persistent and enduring challenge. In the realm of management science, experts, and scholars from both the industrial and academic sectors have continuously explored optimization models and algorithms to effectively address routing problems, from the classical Traveling Salesman Problem to the more general Vehicle Routing Problem. These models and algorithms are applied in real-world industrial scenarios to achieve cost optimization and reduce carbon footprints. However, due to the complexity of real-world problems, numerous specific constraints are often added, and challenges such as information opacity, uncertainty, and irrational human behavior may arise. Therefore, deploying and optimizing mathematical models for VRP in practical scenarios while maintaining optimal results poses numerous challenges. This paper discusses and provides solutions for three different logistic use cases involving external truck network design. Through these industrial case study, the paper introduces how deep reinforcement learning-based vehicle routing optimization has been implemented. As a result, it can be observed that the routes optimized by reinforcement learning agent have over 10% total cost compared to baseline results. Furthermore, the paper proposes that in future research, DRL algorithms for vehicle routing problems could be generalized into more variations of VRP.
These findings demonstrate that reinforcement learning is a promising and scalable alternative to conventional heuristic and metaheuristic approaches for capacitated routing problems, particularly in dynamic logistics environments that require rapid and adaptive decision making.
Audrey Ariij Sya'imaa.HS, Hilda Azkiyah, Khandker Farid Uddin Ahmed· International Journal of Mat...· 0 citations
This work introduces an optimization framework where a reinforcement learning agent is trained on prior instances and quickly generates initial solutions, which are then further optimized by a genetic algorithm, enabling real-time and interactive routing at scale.
Ido Greenberg, P. Sielski, Hugo Linsenmaier et al.· Communications AI & Computin...· 1 citation
A reinforcement learning method with a shared attention encoder and a hierarchical dual-decoder architecture, where truck–drone coordination is achieved by first decoding the truck’s next node and then conditionally decoding the drone action.
The problem of route optimization with realistic constraints is becoming extremely relevant in the face of global urban population growth. While we are aware of approaches that theoretically provide an exact optimal solution, their application becomes challenging as the problem size increases because of exponential com...
A. Soroka, German Mikhelson, A. Mescheryakov et al.· Automation and remote contro...· 0 citations
The study describes the urban vehicle routing problem as a Markov decision process, integrating fleet operations, dynamic traffic conditions, and constantly arriving customer orders from heterogeneous realtime data streams, and proposes a graph-based neural network architecture for capturing complex spatio-temporal dep...
Jinyan Wang, Hong-Juan Cong· International Conference on...· 0 citations
Deep Policy Dynamic Programming is proposed, which aims to combine the strengths of learned neural heuristics with those of DP algorithms, and prioritizes and restricts the DP state space using a policy derived from a deep neural network, which is trained to predict edges from example solutions.
W. Kool, H. van Hoof, J. Gromicho et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.