首页 | 官方网站   微博 | 高级检索  
     

求解多目标背包问题的改进人工鱼群算法
引用本文:黄美华,温洁嫦,何勇.求解多目标背包问题的改进人工鱼群算法[J].广东工业大学学报,2016,33(5):44-48.
作者姓名:黄美华  温洁嫦  何勇
作者单位:广东工业大学 应用数学学院, 广东 广州 510520
基金项目:广东省特色创新项目(2014KTSCX055)
摘    要:作为一种新的群智能算法,在求解多目标背包问题时,人工鱼群算法存在盲目搜索、收敛速度慢和求解精度低等问题.针对这些问题,本文结合人工鱼位置全局最优信息,对人工鱼的移动策略进行自适应改进,提出一种改进的人工鱼群算法.对多目标背包优化问题实验仿真表明,本文改进的人工鱼群算法收敛速度和搜索到的非劣解的精度均优于粒子群算法和遗传算法.

关 键 词:多目标优化    背包问题    人工鱼群算法    自适应  
收稿时间:2015-04-29

An Improved Artificial Fish Swarm Algorithm for Multi-objective Knapsack Problem
HUANG Mei-hua,WEN Jie-chang,HE Yong.An Improved Artificial Fish Swarm Algorithm for Multi-objective Knapsack Problem[J].Journal of Guangdong University of Technology,2016,33(5):44-48.
Authors:HUANG Mei-hua  WEN Jie-chang  HE Yong
Affiliation:School of Applied Mathematics, Guangdong University of Technology, Guangzhou 510520, China
Abstract:As a swarm intelligence, the Artificial Fish Swarm Algorithm(AFSA) has its weakness in solving the problem of Multi-objective Knapsack, such as blindness search, low speed of convergence and low accuracy in solution. Combining the global information of the artificial fish position with improving the moving strategy of artificial fish self-adapting, an improved AFSA is proposed. Simulation on multi-objective knapsack problem shows that the convergence rate as well as the accuracy in the non-dominated solutions which have been found out in the improved AFSA is superior to Genetic Algorithm and Particle Swarm Optimization.
Keywords:multi-objective optimization  Knapsack problem  artificial fish swarm algorithm  self-adaptive  
点击此处可从《广东工业大学学报》浏览原始摘要信息
点击此处可从《广东工业大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号