求解0-1背包问题的双子群果蝇优化算法  

Double subgroups fruit fly optimization algorithm for solving 0-1 knapsack problem

作　　者：李栋[1,2] 张文宇[2] 

机构地区：[1]西北工业大学自动化学院,西安710072 [2]西安邮电大学经济与管理学院,西安710061

出　　处：《计算机应用研究》2015年第11期3273-3277,3282,共6页Application Research of Computers

基　　金：陕西省自然科学基金资助项目(2012GQ8050);陕西省教育厅专项科研计划项目(2013JK0175);陕西省体育局常规课题(13126)

摘　　要：基于双子群协同进化思想和果蝇优化算法,提出了一种求解0-1背包问题的双子群果蝇优化算法。利用双子群协同进化以及群半径自动调节来增强搜索过程的多样性,提高算法全局寻优能力;给出了双子群果蝇优化算法的具体步骤,并用MATLAB软件编程实现。通过对多个0-1背包问题的算例进行测试,并将测试结果与其他文献结果进行比较,结果表明,双子群果蝇优化算法具有较好的全局寻优能力,可作为求解0-1背包问题的一种实用方法。This paper proposed double subgroups fruit fly optimization algorithm to solve 0-1 programming problem, which was based on the double subgroup cooperative thought and fruit fly optimization algorithm. It used double subgroup cooperative and adjusting the group＇ s radius automatically to enhance the diversity of the searching process to improve the ability of global optimization, and described the detailed procedures of the algorithm and programmed with MATLAB software. By some 0-1 programming problem test and comparisons with other literature results, the results show that double subgroups fruit fly optimization algorithm has better global optimization ability. It can be used as a practical approach to solve 0-1 knapsack problem.

关 键 词：0-1背包问题 果蝇优化算法 双子群果蝇优化算法 协同进化 离散空间 

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