计算机工程与应用2011，Vol.47Issue(21)：43-46,4.DOI:10.3778/j.issn.1002-8331.2011.21.011
求解0/1背包问题的改进人工鱼群算法研究
Improved artificial fish school algorithm to solve knapsack problem
摘要
Abstract
After analyzing the disadvantages of artificial fish school algorithm solving combinational optimization problems,an improved artificial fish school algorithm is put forward.Facing the characteristic of KP,this algorithm directly simulates artificial fishs behaviors in the coding space, encoding by the rand key and decoding by the heuristic information, such as the value of unit quality goods (value-quality ratio).The globe searching capability of artificial fish school algorithm is improved by three updating operators,which include good solutions swimming in the coding space at random to search better solutions than themselves, preserving good solutions and substituting good solutions for bad solutions, bad solutions swimming in the coding space at random to search better solutions than themselves.Comparison and analysis are carried out with examples.Algorithm tests show that this algorithm can improve the speed of convergence efficiently and is good at global searching in solution space.关键词
人工鱼群算法/背包问题/组合优化/启发式信息Key words
Artificial Fish School Algorithm(AFSA)/Knapsack Problem(KP)/combinational optimization/heuristic information分类
计算机与自动化引用本文复制引用
厍向阳,朱命昊,赵亚敏..求解0/1背包问题的改进人工鱼群算法研究[J].计算机工程与应用,2011,47(21):43-46,4.基金项目
陕西省自然科学基金(No.2009JM7007) （No.2009JM7007）
陕西省教育厅专项科研计划项目(No.08JK354). （No.08JK354）
