Abstract
The goal of this paper is to propose and test a new memetic algorithm for the capacitated vehicle routing problem in parallel computing environment. In this paper we consider a simple variation of the vehicle routing problem in which the only parameter is the capacity of the vehicle and each client only needs one package. We analyze the efficiency of the algorithm using the hierarchical Parallel Random Access Machine (PRAM) model and run experiments with code written in CUDA. © 2014 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Wodecki, M., Bozejko, W., Karpiński, M., & Pacut, M. (2014). Multi-GPU parallel memetic algorithm for capacitated vehicle routing problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8385 LNCS, pp. 207–214). Springer Verlag. https://doi.org/10.1007/978-3-642-55195-6_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
