Route Planning for Electric Vehicles with Charging Constraints
Recent studies demonstrate the efficacy of machine learning algorithms for learning strategies to solve combinatorial optimization problems. This study presents a novel solution to address the Electric Vehicle Routing Problem with Time Windows (EVRPTW), leveraging deep reinforcement learning (DRL) techniques. Existing DRL approaches frequently encounter challenges when addressing the EVRPTW problem: RNN-based decoders struggle with capturing long-term dependencies, while DDQN models exhibit limited generalization across various problem sizes. To overcome these limitations, we introduce a transformer-based model with a heterogeneous attention mechanism. Transformers excel at capturing long-term dependencies and demonstrate superior generalization across diverse problem instances. We validate the efficacy of our proposed approach through comparative analysis against two state-of-the-art solutions for EVRPTW. The results demonstrated the efficacy of the proposed model in minimizing the distance traveled and robust generalization across varying problem sizes.
Authors
- Wen‐Zhan Song (ORCID: https://orcid.org/0000-0001-8174-1772)
- Aiman Munir
- Ramviyas Parasuraman (ORCID: https://orcid.org/0000-0001-5451-8209)
- Ye Jin (ORCID: https://orcid.org/0009-0002-0952-9579)
Institutions
- University of Georgia (US)
Publication Details
- Published
- 2024-10-07
- DOI
- https://doi.org/10.1109/vtc2024-fall63153.2024.10757558
- Primary Topic
- Transportation and Mobility Innovations
- Type
- article
- Field-Weighted Citation Impact
- 0.00