The b-LAHC algorithm sets 9/10 new best-known results on large-scale E-CVRP benchmarks by using a surrogate-guided bilevel framework with fixed parameters.
A greedy search based evolutionary algorithm for electric vehicle routing problem,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Bilevel Late Acceptance Hill Climbing for the Electric Capacitated Vehicle Routing Problem
The b-LAHC algorithm sets 9/10 new best-known results on large-scale E-CVRP benchmarks by using a surrogate-guided bilevel framework with fixed parameters.