paper-with-me

Papers

Quantum Reinforcement Learning with Transformers for the Capacitated Vehicle Routing Problem

2026-02-05 · Eva Andrés arxiv

This paper addresses the Capacitated Vehicle Routing Problem (CVRP) by comparing classical and quantum Reinforcement Learning (RL) approaches. An Advantage Actor-Critic (A2C) agent is implemented in classical, full quantum, and hybrid variants, integrating transformer architectures to capture the relationships between vehicles, clients, and the depot through self- and cross-attention mechanisms. The experiments focus on multi-vehicle scenarios with capacity constraints, considering 20 clients and 4 vehicles, and are conducted over ten independent runs. Performance is assessed using routing distance, route compactness, and route overlap. The results show that all three approaches are capable of learning effective routing policies. However, quantum-enhanced models outperform the classical baseline and produce more robust route organization, with the hybrid architecture achieving the best overall performance across distance, compactness, and route overlap. In addition to quantitative improvements, qualitative visualizations reveal that quantum-based models generate more structured and coherent routing solutions. These findings highlight the potential of hybrid quantum-classical reinforcement learning models for addressing complex combinatorial optimization problems such as the CVRP.

📄 PDF Abstract BibTeX arXiv:2602.05920

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement Learning

Similar Papers 제목 키워드 기반

Using Reinforcement Learning for the Three-Dimensional Loading Capacitated Vehicle Routing Problem

2023-07-22 · Stefan Schoepf, Stephen Mak, Julian Senoner, Liming Xu 외

Heavy goods vehicles are vital backbones of the supply chain delivery system but also contribute significantly to carbon emissions with only 60% loading efficiency in the United Kingdom. Collaborative vehicle routing has…

reinforcement-learningReinforcement Learning

Graph-Coarsening Approach for the Capacitated Vehicle Routing Problem with Time Windows

2025-10-25 · Mustafa Mert Özyılmaz arxiv

The Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) is a fundamental NP-hard optimization problem in logistics. Solving large-scale instances remains computationally challenging for exact solvers. This pap…

A new Hyper-heuristic based on Adaptive Simulated Annealing and Reinforcement Learning for the Capacitated Electric Vehicle Routing Problem

2022-06-07 · Erick Rodríguez-Esparza, Antonio D Masegosa, Diego Oliva, Enrique Onieva

Electric vehicles (EVs) have been adopted in urban areas to reduce environmental pollution and global warming as a result of the increasing number of freight vehicles. However, there are still deficiencies in routing the…

Fast Approximate Solutions using Reinforcement Learning for Dynamic Capacitated Vehicle Routing with Time Windows

2021-02-24 · Nazneen N Sultana, Vinita Baniwal, Ansuma Basumatary, Piyush Mittal 외

This paper develops an inherently parallelised, fast, approximate learning-based solution to the generic class of Capacitated Vehicle Routing Problems with Time Windows and Dynamic Routing (CVRP-TWDR). Considering vehicl…

Reinforcement Learning (RL)

Multi-GPU parallel memetic algorithm for capacitated vehicle routing problem

2014-01-21 · Michał Karpiński, Maciej Pacut

The goal of this paper is to propose and test a new memetic algorithm for the capacitated vehicle routing problem in parallel computing environment. In this paper we consider simple variation of vehicle routing problem i…

GPU