EUVIMEDEUVIMED entdecken
Crossref

SED2AM: Solving Multi-Trip Time-Dependent Vehicle Routing Problem Using Deep Reinforcement Learning

Arash Mozhdehi, Yunli Wang, Sun Sun, Xin Wang

ACM Transactions on Knowledge Discovery from Data · 30.06.2025 · 19 (5) · 1-33

DOI: 10.1145/3721983 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Transactions on Knowledge Discovery from Data, online erschienen am 22.05.2025. Verfasst von Arash Mozhdehi und 3 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 39 Literaturangaben. Gefördert von: National Research Council of Canada’s Artificial Intelligence for Logistics Program, Natural Sciences and Engineering Research Council of Canada.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Deep Reinforcement Learning (DRL)-based frameworks, featuring Transformer-style policy networks, have demonstrated their efficacy across various Vehicle Routing Problem (VRP) variants. However, the application of these methods to the Multi-Trip Time-Dependent Vehicle Routing Problem (MTTDVRP) with maximum working hours constraints—a pivotal element of urban logistics—remains largely unexplored. This article introduces a DRL-based method called the Simultaneous Encoder and Dual Decoder Attention Model (SED2AM), tailored for the MTTDVRP with maximum working hours constraints. The proposed method introduces a temporal locality inductive bias to the encoding module of the policy networks, enabling it to effectively account for the time dependency in travel distance/time. The decoding module of SED2AM includes a vehicle selection decoder that selects a vehicle from the fleet, effectively associating trips with vehicles for functional multi-trip routing. Additionally, this decoding module is equipped with a trip construction decoder leveraged for constructing trips for the vehicles. This policy model is equipped with two classes of state representations, fleet state, and routing state, providing the information needed for effective route construction in the presence of maximum working hours constraints. Experimental results using real-world datasets from two major Canadian cities not only show that SED2AM outperforms the current state-of-the-art DRL-based and metaheuristic-based baselines but also demonstrate its generalizability to solve larger scale problems.

Förderung

  • National Research Council of Canada’s Artificial Intelligence for Logistics Program
  • Natural Sciences and Engineering Research Council of Canada

Zitieren

APA

Mozhdehi, A., Wang, Y., Sun, S., & Wang, X. (2025). SED2AM: Solving Multi-Trip Time-Dependent Vehicle Routing Problem Using Deep Reinforcement Learning. ACM Transactions on Knowledge Discovery from Data, 19(5), 1-33. https://doi.org/10.1145/3721983

Vancouver

Mozhdehi A, Wang Y, Sun S, Wang X. SED2AM: Solving Multi-Trip Time-Dependent Vehicle Routing Problem Using Deep Reinforcement Learning. ACM Transactions on Knowledge Discovery from Data. 2025;19(5):1-33. doi:10.1145/3721983

BibTeX
@article{Mozhdehi2025,
  author = {Mozhdehi, Arash and Wang, Yunli and Sun, Sun and Wang, Xin},
  title = {SED2AM: Solving Multi-Trip Time-Dependent Vehicle Routing Problem Using Deep Reinforcement Learning},
  journal = {ACM Transactions on Knowledge Discovery from Data},
  year = {2025},
  volume = {19},
  number = {5},
  pages = {1--33},
  doi = {10.1145/3721983}
}
Kostenlos starten →