Utilização do hardware reconfigurável para acelerar algoritmos evolutivos: o caso do problema do caixeiro viajante

Abstract

Evolutionary algorithms (EA) have been shown to be an effective approach for finding near-optimum solutions to problems of combinatorial optimization. The paper analyzes a possibility of acceleration of EA for the traveling salesman problem (TSP) with the aid of reconfigurable hardware. The estimative results show that the combination of general-purpose computer and FPGAresources allows performance to be increased significantly.