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

基于鱼群算法的多维背包问题研究
引用本文:王会颖,倪志伟,陈祥生.基于鱼群算法的多维背包问题研究[J].安徽农业科学,2011(10):6114-6117,6122.
作者姓名:王会颖  倪志伟  陈祥生
作者单位:合肥工业大学过程优化与智能决策教育部重点实验室;安徽财贸职业学院电子信息系
基金项目:国家“863”计划资助项目(2007AA04Z116);国家自然科学基金资助项目(70871033);安徽省教育厅自然科学基金项目(KJ2008B021)
摘    要:将鱼群算法应用于求解多维背包问题,提出一种求解多维背包问题的鱼群算法,MKPAFSA。定义MKPAFSA中的各元素,且引入启发因子和动态因子,并对鱼群算法进行了改进和优化。它减少了人工鱼的搜索时间,有效改善了鱼群算法后期收敛较慢且一般仅能得到满意解域的缺陷。仿真试验取得了较好的结果。

关 键 词:多维背包问题  鱼群算法  多维背包问题鱼群算法

Study on Multidimensional Knapsack Problem Based on Artificial Fish School Algorithm
Institution:WANG Hui-ying et al(Key Laboratory of Process Optimization and Intelligent Decision-making for Ministry of Education,Hefei University of Technology,Hefei,Anhui 230009)
Abstract:Artificial fish school algorithm(AFSA) is used to solve multidimensional knapsack problem(MKP),multidimensional knapsack problem artificial fish school algorithm(MKPAFSA) is put forward.Elements of MKPAFSA are defined,and inspired factor and dynamic factor are introduced,and AFSA is analyzed and optimized.It greatly reduces the searching time of artificial fishes.It also effectively improves the disadvantages of slow convergence and generally only getting satisfied solution domain.The simulation results show that the algorithm is more efficient.
Keywords:Multidimensional knapsack problem  Artificial fish school algorithm  Multidimensional knapsack problem artificial fish school algorithm
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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