计算机工程与设计
計算機工程與設計
계산궤공정여설계
COMPUTER ENGINEERING AND DESIGN
2014年
8期
2778-2784
,共7页
萤火虫算法%贪心策略%变异策略%背包问题%局部极值
螢火蟲算法%貪心策略%變異策略%揹包問題%跼部極值
형화충산법%탐심책략%변이책략%배포문제%국부겁치
firefly algorithm%greedy strategy%mutation strategy%knapsack problem%local optimum
将贪心策略和变异策略与萤火虫算法相结合，提出一种求解0-1背包问题的贪心萤火虫算法。通过增加贪心策略和变异策略，在一定程度上能使萤火虫跳出局部极值，提高算法的性能。通过对多个实例的仿真，将该算法与其它算法如贪心遗传算法、贪心微粒群算法进行对比，对比结果表明，该算法在求解0-1背包问题上具有更强约束处理能力和快速收敛效果。
將貪心策略和變異策略與螢火蟲算法相結閤，提齣一種求解0-1揹包問題的貪心螢火蟲算法。通過增加貪心策略和變異策略，在一定程度上能使螢火蟲跳齣跼部極值，提高算法的性能。通過對多箇實例的倣真，將該算法與其它算法如貪心遺傳算法、貪心微粒群算法進行對比，對比結果錶明，該算法在求解0-1揹包問題上具有更彊約束處理能力和快速收斂效果。
장탐심책략화변이책략여형화충산법상결합，제출일충구해0-1배포문제적탐심형화충산법。통과증가탐심책략화변이책략，재일정정도상능사형화충도출국부겁치，제고산법적성능。통과대다개실례적방진，장해산법여기타산법여탐심유전산법、탐심미립군산법진행대비，대비결과표명，해산법재구해0-1배포문제상구유경강약속처리능력화쾌속수렴효과。
By integrating the greedy and mutation strategy into the firefly algorithm ,a greedy firefly algorithm was proposed to solve 0-1 knapsack problem .The firefly jumped out of the local optimum to a certain extent through adding the greedy and muta-tion strategy ,thus the optimization performance of the algorithm was improved .Through the simulation of some examples and contrasting with other algorithms ,such as greedy genetic algorithm and greedy discrete particle swarm optimization ,the results of the experiment show that the proposed algorithm has stronger constraint handing ability and higher rate of convergence in sol-ving 0-1 knapsack problem .
