Abstract
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.
Paper version not known (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call