Multi-Route Multi-Vehicle Dial-a-Ride Problem: A Comparison Study
Files
Date
2025-01-07
Contributor
Advisor
Department
Instructor
Depositor
Speaker
Researcher
Consultant
Interviewer
Narrator
Transcriber
Annotator
Journal Title
Journal ISSN
Volume Title
Publisher
Volume
Number/Issue
Starting Page
1072
Ending Page
Alternative Title
Abstract
The Multi-Vehicle Dial-a-Ride Problem (MVDARP) consists of routing a fixed number of capacitated vehicles from their initial positions to multiple pick-up locations and, subsequently, to the delivery depots, while minimising the overall costs of the transportation. In this paper, we propose an extended version of the MVDARP which considers multiple consecutive routes: the Multi-Route Multi-Vehicle Dial-a-Ride Problem (MRMVDARP). In this case, a scalarized multi-objective MIP formulation, addressing at the same time the costs of the routing and the duration of the job, is examined together with a Markov Decision Process (MDP) conceptualisation. Thus, the results found using an exact solver applied to the former problem are compared to the solutions of the MDP achieved by Q-learning. The computational experiments tested in small grid-world environments show that the performance of the Reinforcement Learning algorithm outperforms the exact solver in the larger maps tested. This preliminary evaluation indicates a promising research direction that could be explored in the future.
Description
Keywords
Complex Decision Support on Networks - Augmented and Explainable AI in Supply Chains, dial-a-ride problem, mixed integer programming, multi-route multi-vehicle dial-a-ride problem, q-learning, reinforcement learning
Citation
Extent
8
Format
Geographic Location
Time Period
Related To
Proceedings of the 58th Hawaii International Conference on System Sciences
Related To (URI)
Table of Contents
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International
Rights Holder
Local Contexts
Email libraryada-l@lists.hawaii.edu if you need this content in ADA-compliant format.