Adaptive NEH with constrained Nearest Neighbor Subtours for the Electric Vehicle Routing Problem with Time Windows

The development of electric vehicles is currently considered one of the most innovative areas in manufacturing. Largely driven by the desire of reducing greenhouse emissions, electric vehicles are seen as a viable alternative to internal combustion engine cars. Starting from consumer cars, a dedicated effort is being made to translate this into commercial vehicles for freight and delivery. This research introduces a novel adaptive Nawaz, Enscore, Ham (NEH) algorithm with constrained nearest neighbor subtour (NEH-NN). This algorithm is tested on the standard benchmark problems in literature and used as a seed solution for the Genetic Algorithm (GA). From the experiments, the NEH seeded GA significantly improves on the GA, especially for the large sized problem instances.