计算机工程与应用 ›› 2018, Vol. 54 ›› Issue (10): 173-179.DOI: 10.3778/j.issn.1002-8331.1710-0086

• 模式识别与人工智能 • 上一篇    下一篇

求解0-1背包问题的混沌二进制乌鸦算法

刘雪静1,贺毅朝1,吴聪聪1,李  靓2   

  1. 1.河北地质大学 信息工程学院,石家庄 050031
    2.中国邮政集团公司 河北省邮政信息技术局,石家庄 050011
  • 出版日期:2018-05-15 发布日期:2018-05-28

Chaotic binary crow search algorithm for 0-1 knapsack problem

LIU Xuejing1, HE Yichao1, WU Congcong1, LI Liang2   

  1. 1.College of Information Engineering, Hebei GEO University, Shijiazhuang 050031, China
    2.Hebei Post Information Technology Bureau, China Post Group Corporation, Shijiazhuang 050011, China
  • Online:2018-05-15 Published:2018-05-28

摘要: 针对离散空间的最优化问题,提出了二进制乌鸦算法,并在初始解中利用Chebyshev映射产生两种混沌序列优化乌鸦的初始解,保证个体的初始位置在整个搜索空间均匀分布;然后,为快速有效地求解0-1背包问题,引入贪心修复与优化策略处理非正常编码个体,得到基于混沌理论的二进制乌鸦算法(chaotic binary crow search algorithm,CBCSA)。仿真实验表明,CBCSA具有良好的全局寻优能力和收敛速度,能快速求得最优解,且混沌序列的第一映射方式比第二映射方式性能更佳。

关键词: 乌鸦算法, 混沌, 贪心策略, Chebyshev映射, 0-1背包问题

Abstract: In order to solve the optimization problem in discrete space, a binary crow algorithm is proposed, and two chaotic 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.

Key words: crow search algorithm, chaotic, greedy optimization strategy, Chebyshev mapping, 0-1 knapsack problem