By Topic

Genetic algorithms using parallelism and FPGAs: the TSP as case study

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Vega-Rodriguez, M.A. ; Dept. Informatica, Univ. Extremadura, Caceres, Spain ; Gutierrez-Gil, R. ; Avila-Roman, J.M. ; Sanchez-Perez, J.M.
more authors

In this work a detailed study about the implementation of genetic algorithms (GAs) using parallelism and field programmable gate arrays (FPGAs) is presented. Concretely, we use the traveling salesman problem (TSP) as case study. First at all, the TSP is described as well as the GA used for solving it. Afterwards, we present the hardware implementation of this algorithm. We detail 13 different hardware versions, searching that each new version improves the previous one. Many of these improvements are based on the use of parallelism techniques. Finally, the found results are shown and analysed: hardware/software comparisons, resource use, operation frequency, etc. We conclude indicating the parallelism techniques that obtain better results and stating FPGA implementation is better when the problem size increases or when better solutions (nearer to the optimum) must be found.

Published in:

Parallel Processing, 2005. ICPP 2005 Workshops. International Conference Workshops on

Date of Conference:

14-17 June 2005