EUVIMEDObjevte EUVIMED
Crossref

A Graph‐Based Diverse Trajectory‐Driven Attention Model for Vehicle Routing Problems

Bei Ou, Qingshu Guan, Dapeng Yan, Hui Cao

Networks · 2026-07 · 88 (1) · 122-137

DOI: 10.1002/net.70042 ↗

At a glance

Journal article in Networks, published online on 2026-04-20. Written by Bei Ou and 3 co-authors. 60 references. Funded by: National Natural Science Foundation of China, Natural Science Basic Research Program of Shaanxi Province.

AbstraktBibliografické údajeCiteRelated studies

Abstract (original language)

The vehicle routing problem (VRP) has garnered significant interest due to its central role in logistics and transportation systems. However, existing deep reinforcement learning (DRL) approaches often underexploit the structural information encoded in graph topologies, and tend to generate solution trajectories with limited diversity, restricting effective exploration of the solution space. To overcome these limitations, we present a Graph‐based Diverse Trajectory‐driven Attention Model (GDTAM) for solving VRPs across a range of scales and types. Built upon a transformer backbone, GDTAM operates directly on undirected graphs and integrates an edge‐driven graph attention block within the encoder, enabling the joint modeling of node‐ and edge‐level topological features. To enhance adaptability to dynamic environments, we introduce a feature integrator that bridges the encoder and decoder, enabling the fusion of real‐time state features with static graph representations. Moreover, GDTAM incorporates a multi‐decoder architecture with identical structures but independently network parameters, promoting the generation of diverse routing trajectories through a Jensen–Shannon divergence regularization term. We evaluate GDTAM on four canonical VRP variants, i.e., the traveling salesman problem (TSP), the capacitated VRP (CVRP), the orienteering problem (OP), and the asymmetric traveling salesman problem (ATSP). Experimental results demonstrate that GDTAM represents a meaningful advancement over mainstream heuristic and DRL‐based baselines, while exhibiting strong generalization across various problem scales, underscoring its effectiveness and robustness for real‐world routing applications.

Funding

  • National Natural Science Foundation of China
  • Natural Science Basic Research Program of Shaanxi Province

Cite

APA

Ou, B., Guan, Q., Yan, D., & Cao, H. (2026). A Graph‐Based Diverse Trajectory‐Driven Attention Model for Vehicle Routing Problems. Networks, 88(1), 122-137. https://doi.org/10.1002/net.70042

Vancouver

Ou B, Guan Q, Yan D, Cao H. A Graph‐Based Diverse Trajectory‐Driven Attention Model for Vehicle Routing Problems. Networks. 2026;88(1):122-137. doi:10.1002/net.70042

BibTeX
@article{Ou2026,
  author = {Ou, Bei and Guan, Qingshu and Yan, Dapeng and Cao, Hui},
  title = {A Graph‐Based Diverse Trajectory‐Driven Attention Model for Vehicle Routing Problems},
  journal = {Networks},
  year = {2026},
  volume = {88},
  number = {1},
  pages = {122--137},
  doi = {10.1002/net.70042}
}
Start for free →