12396

Implementation of the genetic algorithm by means of CUDA technology involved in travelling salesman problem

Anna Plichta, Tomasz Gaciarz, Bartosz Baranowski, Szymon Szominski
Cracow University of Technology, Department of Computer Science, 31-155 Cracow, ul.Warszawska 24
28th European Conference on Modelling and Simulation (ECMS), 2014

@article{plichta2014implementation,

   title={Implementation of the genetic algorithm by means of CUDA technology involved in travelling salesman problem},

   author={Plichta, Anna and Gaciarz, Tomasz and Baranowski, Bartosz and Szominski, Szymon},

   year={2014}

}

Download Download (PDF)   View View   Source Source   

1297

views

The research was intended to solve the travelling salesman problem by means of genetic algorithms. The implementation of the algorithm was by virtue of CUDA technology. The research was focused on checking how much the system can improve if instead of classical CPU processors one uses GPU graphical processors enabled to perform the operations parallel. The algorithm was implemented in the high level CUDA C language. Thus, measuring the pure time of performance of the algorithm could be the single but reliable point of comparison between two above mentioned types of processors. Making some operations mutually independent and using CUDA technology makes the task much faster to execute. Due to it complex issues can be solved in a shorter time.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: