Reproduce “Variable Neighborhood Search for the Electric Vehicle Routing Problem” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
David Woller, Viktor Kozák, Miroslav Kulich, Libor Přeučil
The authors present an electric-vehicle routing solver using variable neighborhood search (VNS) to minimize distance while respecting cargo capacity and battery range. It repairs routes and improves them through route changes and charging-station choices. In 2020 competition results, it had the best single-run score on 16 of 17 instances and best mean on 15, on a benchmark without time windows.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.