基于FPGA的背包问题的求解  

The solving knapsack problem based on FPGA

作　　者：杨益[1] 

机构地区：[1]安徽建筑工业学院电子与信息工程学院,合肥230601

出　　处：《安徽建筑工业学院学报（自然科学版）》2010年第4期81-84,共4页Journal of Anhui Institute of Architecture(Natural Science)

基　　金：建筑能效控制与评估教育部工程研究中心(KF2009.08.02;KF2009.08.01);建设部科技计划项目(2008-K6-25)

摘　　要：采用Handel-C语言对基本遗传算法和改进的遗传算法进行编程来求解背包问题,并且给出了应用这两个算法的具体步骤。通过对实例仿真实验,改进的遗传算法明显提高了算法的全局搜索能力和收敛速度,验证了算法的有效性,并且最终在FPGA上实现对背包问题的求解。The paper adopts Handel-C language to program for the simple and improved genetic algorithm that solves knapsack problem and provides the algorithm procedure in detail. The improved genetic algorithm enhances obviously global search ability and converging velocity through simulating the example. Thus the effectiveness of the improved algorithm is demonstrated. Finally, the software system has been implemented all right in the FPGA that can solve knapsack problem.

关 键 词：背包问题 遗传算法 现场可编程门阵列(FPGA) HANDEL-C语言 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]