Open Access. Powered by Scholars. Published by Universities.®
Artificial Intelligence and Robotics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Publication
- Publication Type
Articles 1 - 3 of 3
Full-Text Articles in Artificial Intelligence and Robotics
Multi-Depot Half-Open Vehicle Routing Problem With Simultaneous Delivery-Pickup And Time Windows, Yingyu Zhang, Liyun Wu, Shengtai Jia
Multi-Depot Half-Open Vehicle Routing Problem With Simultaneous Delivery-Pickup And Time Windows, Yingyu Zhang, Liyun Wu, Shengtai Jia
Journal of System Simulation
Abstract: To solve the multi-depot half-open vehicle routing problem with simultaneous delivery-pickup and time windows, this paper builds a mathematical model of a multi-depot half-open vehicle routing problem with simultaneous delivery-pickup and time windows by balancing the vehicle in and out of the distribution center and minimizing vehicle delivery distance as the goal. According to the characteristics of the problem, a brain storm algorithm based on chaotic mutation is designed to solve this problem,and the sequential crossover strategy is adopted to increase the population diversity. Meanwhile, the algorithm selects two chaotic maps for chaotic mutation operation, which employs the diversity, …
Reinforcement Learning Approach To Stochastic Vehicle Routing Problem With Correlated Demands, Zangir Iklassov, Ikboljon Sobirov, Ruben Solozabal, Martin Takac
Reinforcement Learning Approach To Stochastic Vehicle Routing Problem With Correlated Demands, Zangir Iklassov, Ikboljon Sobirov, Ruben Solozabal, Martin Takac
Machine Learning Faculty Publications
We present a novel end-to-end framework for solving the Vehicle Routing Problem with stochastic demands (VRPSD) using Reinforcement Learning (RL). Our formulation incorporates the correlation between stochastic demands through other observable stochastic variables, thereby offering an experimental demonstration of the theoretical premise that non-i.i.d. stochastic demands provide opportunities for improved routing solutions. Our approach bridges the gap in the application of RL to VRPSD and consists of a parameterized stochastic policy optimized using a policy gradient algorithm to generate a sequence of actions that form the solution. Our model outperforms previous state-of-the-art metaheuristics and demonstrates robustness to changes in the …
The Vehicle Routing Problem With Simultaneous Pickup And Delivery And Occasional Drivers, Vincent F. Yu, Grace Aloina, Panca Jodiawan, Aldy Gunawan, Tsung-C. Huang
The Vehicle Routing Problem With Simultaneous Pickup And Delivery And Occasional Drivers, Vincent F. Yu, Grace Aloina, Panca Jodiawan, Aldy Gunawan, Tsung-C. Huang
Research Collection School Of Computing and Information Systems
This research addresses the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Occasional Drivers (VRPSPDOD), which is inspired from the importance of addressing product returns and the emerging notion of involving available crowds to perform pickup and delivery activities in exchange for some compensation. At the depot, a set of regular vehicles is available to deliver and/or pick up customers’ goods. A set of occasional drivers, each defined by their origin, destination, and flexibility, is also able to help serve the customers. The objective of VRPSPDOD is to minimize the total traveling cost of operating regular vehicles and total …