Solving Heterogeneous Capacitated Vehicle Routing Problem Assisted with Deep Reinforcement Learning

The heterogeneous capacitated vehicle routing problem (HCVRP) is an NP-hard problem with broad applications and growing importance. Traditionally, exact algorithms and heuristic algorithms have been the two primary approaches for solving this problem, but they face computational efficiency bottlenecks when handling large-scale instances. To address this challenge, this paper proposes a hybrid method by integrating deep reinforcement learning with an existing heuristic algorithm, SISRs. Experimental results indicate that the proposed hybrid method successfully combines the strengths of both heuristic and DRL algorithms, outperforming SISRs and DRL-based method in terms of route length while achieving significant reduction of computation time, compared to SISRs.

Authors

Institutions

Publication Details

Published
2025-07-19
DOI
https://doi.org/10.1109/amlds63918.2025.11159420
Primary Topic
Traffic control and management
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Solving Heterogeneous Capacitated Vehicle Routing Problem Assisted with Deep Reinforcement Learning

Yi‐Hao Chen, Kuo-Chan Huang
Traffic control and management
article

Solving Heterogeneous Capacitated Vehicle Routing Problem Assisted with Deep Reinforcement Learning

Yi‐Hao Chen, Kuo-Chan Huang
article en

Abstract

The heterogeneous capacitated vehicle routing problem (HCVRP) is an NP-hard problem with broad applications and growing importance. Traditionally, exact algorithms and heuristic algorithms have been the two primary approaches for solving this problem, but they face computational efficiency bottlenecks when handling large-scale instances. To address this challenge, this paper proposes a hybrid method by integrating deep reinforcement learning with an existing heuristic algorithm, SISRs. Experimental results indicate that the proposed hybrid method successfully combines the strengths of both heuristic and DRL algorithms, outperforming SISRs and DRL-based method in terms of route length while achieving significant reduction of computation time, compared to SISRs.

National Taichung University of Education (TW)
Openalex Percentile: Top 69%
Traffic control and management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.