Back to search

Central Washington University

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

Abstract

dc:description.abstract

The development of electric vehicles is currently considered one of the most innovative areas in manufacturing. Largely driven by the desire to reduce 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). The performance and runtime of the algorithms are enhanced with the usage of CUDA to incorporate a High Performance Computing approach to computational optimization. From the experiments, the NEH seeded GA significantly improves on the GA, especially for the large-sized problem instances. CUDA further enhances the solution quality and execution time, making it a crucial component of this research.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Discipline thesis:degree_discipline
Computational Science

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Struthers, Andrew
Contributors dc:contributor
  • Dr. Donald Davendra
  • Dr. Szilard VAJDA
  • Dr. Razvan Andonie

Subjects

dc:subject × 20

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.cwu.edu/etd/1967

Chain of custody

source
Harvested from
Central Washington University
Base URL
digitalcommons.cwu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Struthers, Andrew. Adaptive NEH with Constrained Nearest Neighbor Subtours for the Electric Vehicle Routing Problem with Time Windows. https://digitalcommons.cwu.edu/etd/1967