遗传算法求解TSP问题的FPGA实现

The implementation of a FPGA-based genetic algorithm for TSP

TSP问题是一种典型的组合优化问题。基于FPGA实现会提高求解速度 ,能推动TSP问题在其它实际工程的应用 ,具有实用性意义。本文提出了一种基于FPGA求解TSP问题的遗传算法的硬件系统。首先针对TSP问题的特点 ,进行算法选择 ,确定了一个易于硬件实现的算法。然后提出了一个能进行群体存储、适应度处理、选择、交叉和变异等操作的硬件结构。通过流水线结构和并行化操作 。

Taveling saleman problem (TSP) is a kind of typical optimization problem The implementation of FPGA based can improve the speed, so it can promote the application of TSP to other fields A implementation of a FPGA based genetic algorithm for TSP is proposed in this paper At first according the fenture of TSP, the algorithm which can be easlly realized for hardware is investigated, an architecture that can perform the function of popultion, fitness evaluation, crossover, mutation is designed It can improve the efficiency of the system by pipeline and parallelism