首页 | 本学科首页   官方微博 | 高级检索  
     检索      

求解多维0-1背包问题的人工鱼群算法
引用本文:李春梅,马良.求解多维0-1背包问题的人工鱼群算法[J].数学的实践与认识,2010,40(17).
作者姓名:李春梅  马良
基金项目:国家自然科学基金,上海市重点学科建设资助项目
摘    要:对于多维0-1背包问题,国内外学者提出了诸如模拟退火、遗传算法、蚁群算法以及其他启发式算法.给出一种新的智能寻优方法——人工鱼群算法.算法通过各人工鱼的局部寻优,从而在群体中体现出全局最优.描述了人工鱼群算法的具体步骤并编程实现,通过多维背包算例进行了求解测试,获得了满意的效果.

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

Artificial Fish-Swarm Algorithm for Multi-Dimensional 0-1 Knapsack Problem
LI Chun-mei,MA Liang.Artificial Fish-Swarm Algorithm for Multi-Dimensional 0-1 Knapsack Problem[J].Mathematics in Practice and Theory,2010,40(17).
Authors:LI Chun-mei  MA Liang
Abstract: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.
Keywords:multi-dimensional 0-1 knapsack  AFSA  optimization
本文献已被 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号