0-1背包问题的蜂群优化算法  

Artificial Bee Colony Algorithm for 0-1 Knapsack Problem

作　　者：樊小毛[1] 马良[1] 

机构地区：[1]上海理工大学管理学院,上海200093

出　　处：《数学的实践与认识》2010年第6期155-160,共6页Mathematics in Practice and Theory

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

摘　　要：在项目决策与规划、资源分配、货物装载、预算控制等工作中,提出了0-1背包问题.0-1背包问题是组合优化中的典型NP难题,根据群集智能原理,给出一种基于蜂群寻优思想的新算法—蜂群算法,并针对0-1背包问题进行求解.经实验仿真并与蚁群算法计算结果作对比,验证了算法在0-1背包问题求解上的有效性和更快的收敛速度.In the work of the project decision-making and planning,resource allocation, cargo loading,budget control,put forward a 0-1 knapsack problem.0-1 Knapsack problem is a classical NP-hard problem in combinatorial optimization.According to the principle of swarm intelligence,this paper presented a new optimization algorithm based on bee colony-bee colony algorithm.To solve the 0-1 knapsack problem with the proposed algorithm, experimental results of numerical simulations,compared with that of ant colony algorithm, have shown the validity and effectiveness of the algorithm on the knapsack problem.

关 键 词：蜂群算法 背包问题 群集智能 

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