模糊人工蜂群算法的多选择多维背包问题求解  

Fuzzy Artificial Bees Colony Algorithm for Solving Multi-choice Multidimensional Knapsack Problem

作　　者：柳寅[1] 马良[1] 黄钰[2] 

机构地区：[1]上海理工大学管理学院,上海200093 [2]上海理工大学出版印刷与艺术设计学院,上海200093

出　　处：《运筹与管理》2013年第5期98-103,共6页Operations Research and Management Science

基　　金：国家自然科学基金资助项目(70871081);上海市重点学科建设资助项目(S30504);上海市研究生创新基金资助项目(JWCXSL1201)

摘　　要：针对传统人工蜂群算法早熟收敛问题,基于模糊化处理和蜂群寻优的特点,提出一种模糊人工蜂群算法。将模糊输入输出机制引入到算法中来保持蜜源访问概率的动态更新。根据算法计算过程中的不同阶段对蜜源访问概率有效调整,避免算法陷入局部极值。通过对多选择多维背包问题的仿真实验和与其他算法的比较,表明本算法可行有效,有良好的鲁棒性。Aiming at the premature convergence problem in traditional artificial bees colony algorithm, fuzzy artificial bees colony algorithm is proposed, which is ba.sed on the principles of fuzzy processing and bees colony behavior. Fuzzy inputs and fuzzy outputs are introduced into the algorithm to maintain dynamic updates of the nectar access probability. According to effective adjustment on nectar access probability during the different stages of algorithm calculation, the algorithm avoids local optima. Simulated tests of multi-choice multidimensional knapsack problem and comparisons with other algorithms show the algorithm is feasible and effective and the algorithm has strong global optimization ability.

关 键 词：智能优化算法 模糊规则 模糊人工蜂群算法 多选择多维背包问题 

分 类 号：O211.1[理学—概率论与数理统计]