中国工程科学Issue(8)：106-112,7.
改进二进制人工蜂群算法求解多维背包问题
Modified binary artificial bee colony algorithm for multidimensional knapsack problem
摘要
Abstract
The-binary-artificial-bee-colony-algorithm-has-the-shortcomings-of-slower-conver-gence-speed-and-falling-into-local-optimum-easily.-According-to-the-defects,a-modified-binary-artificial-bee-colony-algorithm-is-proposed.-The-algorithm-redesign-neighborhood-search-formu-la-in-artificial-bee-colony-algorithm,the-probability-of-the-food-position-depends-on-the-Bayes-formula.-The-modified-algorithm-was-used-for-solving-multidimensional-knapsack-problem.-During-the-evolution-process,it-used-the-greedy-algorithm-to-repair-the-infeasible-solution-and-rectify-feasible-solution-with-insufficient-use.-The-simulation-results-showed-the-feasibility-and-effectiveness-of-the-proposed-algorithm.关键词
人工蜂群算法/多维背包问题/贪婪算法/组合优化Key words
artificial bee colony algorithm/multidimensional knapsack problem/greedy al-gorithm/combinatorial optimization分类
信息技术与安全科学引用本文复制引用
王志刚,夏慧明..改进二进制人工蜂群算法求解多维背包问题[J].中国工程科学,2014,(8):106-112,7.基金项目
南京师范大学泰州学院资助项目(Q201232) （Q201232）
