计算机工程与应用2018，Vol.54Issue(10)：173-179,7.DOI:10.3778/j.issn.1002-8331.1710-0086
求解0-1背包问题的混沌二进制乌鸦算法
Chaotic binary crow search algorithm for 0-1 knapsack problem
摘要
Abstract
In order to solve the optimization problem in discrete space,a binary crow algorithm is proposed,and two cha-otic sequences by using Chebyshev mapping are generated in the initial solution,so the initial positions of the individuals are distributed throughout the search space;the greedy repair and optimization strategy is used to deal with the invalid individual of 0-1 knapsack problem,and Chaotic Binary Crow Search Algorithm(CBCSA)is proposed.The simulation results show that CBCSA has faster speed and better optimization ability than other algorithms for 0-1KP, and the first mapping method is better than the second mapping method.关键词
乌鸦算法/混沌/贪心策略/Chebyshev映射/0-1背包问题Key words
crow search algorithm/chaotic/greedy optimization strategy/Chebyshev mapping/0-1 knapsack problem分类
信息技术与安全科学引用本文复制引用
刘雪静,贺毅朝,吴聪聪,李靓..求解0-1背包问题的混沌二进制乌鸦算法[J].计算机工程与应用,2018,54(10):173-179,7.基金项目
河北省高等学校科学研究计划项目(No.ZD2016005) （No.ZD2016005）
河北省自然科学基金(No.F2016403055). （No.F2016403055）
