Bibliographic Details
| Title: |
Parallel ant system for the electric vehicle routing problem with time windows using CUDA. |
| Authors: |
Struthers, Andrew1 (AUTHOR), Davendra, Donald2 (AUTHOR) Donald.Davendra@cwu.edu |
| Source: |
Neural Computing & Applications. Apr2026, Vol. 38 Issue 7, p1-38. 38p. |
| Subjects: |
Vehicle routing problem, Ant algorithms, Genetic algorithms, Parallel programming, Heuristic algorithms, Mathematical optimization, Scheduling |
| Abstract: |
The development of electric vehicles, driven by environmental imperatives, is a rapidly growing field, particularly in the freight sector. However, widespread adoption faces unique challenges, including payload capacity, battery limitations, charging infrastructure, and charging speed. This research introduces a parallel Ant System implemented using CUDA to address the Electric Vehicle Routing Problem with Time Windows (EVRPTW). Comprehensive experimentation was conducted on benchmark datasets, with performance compared against other heuristic approaches such as the NEH algorithm and Genetic Algorithms, leveraging a pairwise seed-based methodology. The results demonstrate significant scalability and adaptability of the proposed algorithm, achieving high-quality solutions efficiently. [ABSTRACT FROM AUTHOR] |
|
Copyright of Neural Computing & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
