vix.ing · top · new · best · stats · spec

Variable Neighborhood Search for the Electric Vehicle Routing Problem

2025/11/11 by David Woller, Viktor Kozák, Woller, David +5
Engineering · #Artificial Intelligence (cs.AI) #Electric Vehicles and Infrastructure #FOS: Computer and information sciences #Transportation and Mobility Innovations #Vehicle Routing Optimization Methods

paper · pdf · doi:10.48550/arxiv.2511.09570

openalex publication_date 2025/11/11 · openalex created_date 2025/11/15 · openalex updated_date 2026/07/28

Abstract

The Electric Vehicle Routing Problem (EVRP) extends the classical Vehicle Routing Problem (VRP) to reflect the growing use of electric and hybrid vehicles in logistics. Due to the variety of constraints considered in the literature, comparing approaches across different problem variants remains challenging. A minimalistic variant of the EVRP, known as the Capacitated Green Vehicle Routing Problem (CGVRP), was the focus of the CEC-12 competition held during the 2020 IEEE World Congress on Computational Intelligence. This paper presents the competition-winning approach, based on the Variable Neighborhood Search (VNS) metaheuristic. The method achieves the best results on the full competition dataset and also outperforms a more recent algorithm published afterward.

Related