将贪心策略和变异策略与萤火虫算法相结合,提出一种求解0-1背包问题的贪心萤火虫算法。通过增加贪心策略和变异策略,在一定程度上能使萤火虫跳出局部极值,提高算法的性能。通过对多个实例的仿真,将该算法与其它算法如贪心遗传算法、贪心微粒群算法进行对比,对比结果表明,该算法在求解0-1背包问题上具有更强约束处理能力和快速收敛效果。 Taking advantage of the standard firefly algorithm （FA） and combining with the characteristics of the 0-1 knapsack problem, this paper designs a firefly algorithm based on 0-1 knapsack problem. After experimental simulation, we verified the firefly algorithm＇ s feasibility and effectiveness to solve 0-1 knapsack problem. Finally, after many simulation experiments, this paper analyzes the influence of various parameters on the algorithm performance, reflected the importance of selection of key pa- rameters to the algorithm optimization.中国博士后基金项目(2012M511711);广西混杂计算与集成电路设计分析重点实验室开放基金项目(2012HCI08);广西教育厅基金项目(201204LX082);广西民族大学基金项目(2011MDYB030
