求解多维0-1背包问题的人工鱼群算法  

Artificial Fish-Swarm Algorithm for Multi-Dimensional 0-1 Knapsack Problem

作　　者：李春梅[1] 马良[1] 

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

出　　处：《数学的实践与认识》2010年第17期195-199,共5页Mathematics in Practice and Theory

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

摘　　要：对于多维0-1背包问题,国内外学者提出了诸如模拟退火、遗传算法、蚁群算法以及其他启发式算法.给出一种新的智能寻优方法——人工鱼群算法.算法通过各人工鱼的局部寻优,从而在群体中体现出全局最优.描述了人工鱼群算法的具体步骤并编程实现,通过多维背包算例进行了求解测试,获得了满意的效果.For multi-dimensional 0-1 knapsack problem,series of algorithms have been studied such as simulated annealing,genetic algorithm,ant algorithm and some other heuristics. In this paper,we propose a kind of new intelligent optimization algorithm-Artificial Fish-Swarm Algorithm（AFSA）.The algorithm tends to reach the global optimum through the separate behaviour of local searching of the individuals.The detailed procedures of the algorithm are described and coded.By typical experimental test of examples,the satisfactory results show that the AFSA can be a promising algorithm for multi-dimensional 0-1 knapsack problem.

关 键 词：多维0-1背包问题 人工鱼群算法 优化 

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