Vehicle Routing Problems via Quantum Graph Attention Network Deep Reinforcement Learning

• URL: http://arxiv.org/abs/2511.15175v1
• Date: Wed, 19 Nov 2025 06:54:38 GMT
• Title: Vehicle Routing Problems via Quantum Graph Attention Network Deep Reinforcement Learning
• Authors: Le Tung Giang, Vu Hoang Viet, Nguyen Xuan Tung, Trinh Van Chien, Won-Joo Hwang,
• Abstract summary: Vehicle routing problem (VRP) is a fundamental NP-hard task in intelligent transportation systems with broad applications in logistics and distribution.<n>We propose a Quantum Graph Neural Network (Q-GAT) framework, where parameterized quantum circuits (PQCs) replace conventional train encoders.<n>Experiments show that Q-GAT achieves faster convergence and reduces routing cost by about 5% compared with classical GATs.
• Score: 6.587064004152391
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The vehicle routing problem (VRP) is a fundamental NP-hard task in intelligent transportation systems with broad applications in logistics and distribution. Deep reinforcement learning (DRL) with Graph Neural Networks (GNNs) has shown promise, yet classical models rely on large multi-layer perceptrons (MLPs) that are parameter-heavy and memory-bound. We propose a Quantum Graph Attention Network (Q-GAT) within a DRL framework, where parameterized quantum circuits (PQCs) replace conventional MLPs at critical readout stages. The hybrid model maintains the expressive capacity of graph attention encoders while reducing trainable parameters by more than 50%. Using proximal policy optimization (PPO) with greedy and stochastic decoding, experiments on VRP benchmarks show that Q-GAT achieves faster convergence and reduces routing cost by about 5% compared with classical GAT baselines. These results demonstrate the potential of PQC-enhanced GNNs as compact and effective solvers for large-scale routing and logistics optimization.

Related papers

• Graph Neural Network-Based Multicast Routing for On-Demand Streaming Services in 6G Networks [43.88530200050682]
  This paper presents a graph neural network (GNN)-based multicast routing framework that jointly minimizes total transmission cost and supports user-specific video quality requirements.<n>The proposed method closely approximates optimal dynamic programming-based solutions while significantly reducing computational complexity.<n>The results also confirm strong generalization to large-scale and dynamic network topologies, highlighting the method's potential for real-time deployment in 6G multimedia delivery scenarios.
  arXiv  Detail & Related papers  (2025-10-13T08:00:45Z)
• Reinforcement Learning for Quantum Network Control with Application-Driven Objectives [53.03367590211247]
  Dynamic programming and reinforcement learning offer promising tools for optimizing control strategies.<n>We propose a novel RL framework that directly optimize non-linear, differentiable objective functions.<n>Our work comprises the first step towards non-linear objective function optimization in quantum networks with RL, opening a path towards more advanced use cases.
  arXiv  Detail & Related papers  (2025-09-12T18:41:10Z)
• SFATTI: Spiking FPGA Accelerator for Temporal Task-driven Inference -- A Case Study on MNIST [39.79758414095764]
  Spiking Neural Networks (SNNs) are promising due to their event-driven and temporally sparse nature.<n>This paper explores using the open-source Spiker+ framework to generate optimized SNNs accelerators for handwritten digit recognition.
  arXiv  Detail & Related papers  (2025-07-04T08:22:13Z)
• Learning Load Balancing with GNN in MPTCP-Enabled Heterogeneous Networks [13.90387346843845]
  We propose a graph neural network (GNN)-based model to tackle the LB problem for MP TCP-enabled HetNets.<n>Compared to the conventional deep neural network (DNN), the proposed GNN-based model exhibits two key strengths.
  arXiv  Detail & Related papers  (2024-10-22T15:49:53Z)
• SPARQ: Efficient Entanglement Distribution and Routing in Space-Air-Ground Quantum Networks [50.91365514137301]
  Space-air-ground quantum (SPARQ) network is developed as a means for providing a seamless on-demand entanglement distribution. Deep reinforcement learning framework is proposed and trained using deep Q-network (DQN) on multiple graphs of SPARQ. Third-party entanglement distribution policy is proposed to establish entanglement between communication parties.
  arXiv  Detail & Related papers  (2024-09-19T16:31:37Z)
• Machine-Learning Insights into the Entanglement-trainability Correlation of Parameterized Quantum Circuits [17.975555487972166]
  Variational quantum algorithms (VQAs) have emerged as the leading strategy to obtain quantum advantage on the current noisy intermediate-scale devices.<n>Their entanglement-trainability correlation, as the major reason for the barren plateau (BP) phenomenon, poses a challenge to their applications.<n>In this Letter, we suggest a gate-to-tensor (GTT) encoding method for parameterized quantum circuits (PQCs)<n>Two long short-term memory networks (L-G networks) are trained to predict both entanglement and trainability.
  arXiv  Detail & Related papers  (2024-06-04T06:28:05Z)
• Are GATs Out of Balance? [73.2500577189791]
  We study the Graph Attention Network (GAT) in which a node's neighborhood aggregation is weighted by parameterized attention coefficients. Our main theorem serves as a stepping stone to studying the learning dynamics of positive homogeneous models with attention mechanisms.
  arXiv  Detail & Related papers  (2023-10-11T06:53:05Z)
• Predicting Expressibility of Parameterized Quantum Circuits using Graph Neural Network [5.444441239596186]
  We propose a novel method based on Graph Neural Networks (GNNs) for predicting the expressibility of Quantum Circuits (PQCs) By leveraging the graph-based representation of PQCs, our GNN-based model captures intricate relationships between circuit parameters and their resulting expressibility. Experimental evaluation on a four thousand random PQC dataset and IBM Qiskit's hardware efficient ansatz sets demonstrates the superior performance of our approach.
  arXiv  Detail & Related papers  (2023-09-13T14:08:01Z)
• Comprehensive Graph Gradual Pruning for Sparse Training in Graph Neural Networks [52.566735716983956]
  We propose a graph gradual pruning framework termed CGP to dynamically prune GNNs. Unlike LTH-based methods, the proposed CGP approach requires no re-training, which significantly reduces the computation costs. Our proposed strategy greatly improves both training and inference efficiency while matching or even exceeding the accuracy of existing methods.
  arXiv  Detail & Related papers  (2022-07-18T14:23:31Z)
• Collaborative Intelligent Reflecting Surface Networks with Multi-Agent Reinforcement Learning [63.83425382922157]
  Intelligent reflecting surface (IRS) is envisioned to be widely applied in future wireless networks. In this paper, we investigate a multi-user communication system assisted by cooperative IRS devices with the capability of energy harvesting.
  arXiv  Detail & Related papers  (2022-03-26T20:37:14Z)
• Optimizing Memory Placement using Evolutionary Graph Reinforcement Learning [56.83172249278467]
  We introduce Evolutionary Graph Reinforcement Learning (EGRL), a method designed for large search spaces. We train and validate our approach directly on the Intel NNP-I chip for inference. We additionally achieve 28-78% speed-up compared to the native NNP-I compiler on all three workloads.
  arXiv  Detail & Related papers  (2020-07-14T18:50:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.