List your company

Capacitated Vehicle Routing Problem on CVRP 100

0Optimality Gap (%)HGS
-0.72244.15389.0313.9062Sep 27, 2025Nov 11, 2025Dec 26, 2025Feb 10, 2026Mar 27, 2026May 11, 2026Jun 26, 2026

Evaluation results

MethodLinks
HGSTime=32h2026.03015.51—
OracleTime=9.1m2025.090——
LKH3Type=Traditional2026.05015.6812
two-stage DRL-based neural heuristicTime(s)=0.092026.06015.8—
MViewRouterAugmentation=×8 aug.2026.050.1915.7155
POMOAugmentation=×8 aug.2026.050.3215.7340
POMO+PO2026.050.8215.8140
MViewRouterAugmentation=original2026.050.8215.817
LKH3Time=13h2026.030.915.65—
POMOAugmentation=no aug.2026.050.9815.835
Constraints Matrix Diffusion based Generative Neural Solver (×8Aug)Augmentation=8x, Time=2m2026.031.2315.7—
POMOTime=6s2025.091.25——
POMO×8AugAugmentation=8x, Time=2m2026.031.4215.73—
ReLD-MTLTime=8s2025.091.42——
Sym-NCOTime=6s2025.091.46——
Sym-NCO2026.051.5115.9240
Constraints Matrix Diffusion based Generative Neural SolverTime=12s2026.031.6115.76—
URS-STLTime=6s2025.091.63——
MVMoETime=12s2025.091.65——
URSTime=6s2025.091.81——
MTPOMOTime=6s2025.091.85——
ReLD ×8AugAugmentation=8x, Time=1.34m2026.031.8715.8—
ICAMTime=4s2025.092.04——
ELG×8Aug ensemble 0.4 Local SizeAugmentation=8x, Ensemble Local Size=0.4, Time=3.18m2026.032.1315.84—
AMTime(s)=0.192026.062.3216.17—
BQTime=8s2025.093.24——
LEHDTime=2s2025.093.68——
POMOTime=3s2026.034.1316.15—
AM SamplingSearch strategy=Sampling, Time=30m2026.034.1916.16—
GOAL-MTLTime=48s2025.094.22——
LEHD GreedySearch strategy=Greedy, Time=30s2026.034.5916.22—
GASETime=7s2026.034.616.37—
E-GATTime=17s2026.036.6816.69—
AMTime=8s2026.038.3216.8—
PSOTime(s)=1.772026.068.917.21—
OR ToolsTime=*1054s2026.0310.1917.09—
ALNSTime(s)=3.372026.0610.3817.44—
PtrNetTime=<1s2026.0311.0917.23—
ReVELbackbone=ACO-based2026.0314.88——
ReEvobackbone=ACO-based2026.0318.06——