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

自适应Tent混沌搜索的人工蜂群算法
引用本文:匡芳君,徐蔚鸿,金忠.自适应Tent混沌搜索的人工蜂群算法[J].控制理论与应用,2014,31(11):1502-1509.
作者姓名:匡芳君  徐蔚鸿  金忠
作者单位:1. 南京理工大学计算机科学与工程学院,江苏南京210094;湖南安全技术职业学院电气与信息工程系,湖南长沙410151
2. 南京理工大学计算机科学与工程学院,江苏南京210094;长沙理工大学计算机与通信工程学院,湖南长沙410114
3. 南京理工大学计算机科学与工程学院,江苏南京,210094
基金项目:国家自然科学基金资助项目(61373063, 61233011, 61125305); 湖南省科技计划资助项目(2013FJ4217); 湖南省教育厅资助科研项目(13C086).
摘    要:为了有效改善人工蜂群算法(artificial bee colony algorithm,ABC)的性能,结合Tent混沌优化算法,提出自适应Tent混沌搜索的人工蜂群算法.该算法使用Tent混沌以改善ABC的收敛性能,避免陷入局部最优解,首先应用Tent映射初始化种群,使得初始个体尽可能均匀分布,其次自适应调整混沌搜索空间,并以迄今为止搜索到的最优解产生Tent混沌序列,从而获得最优解.通过对6个复杂高维的基准函数寻优测试,仿真结果表明,该算法不仅加快了收敛速度,提高了寻优精度,与其他最近改进人工蜂群算法相比,其性能整体较优,尤其适合复杂的高维函数寻优.

关 键 词:人工蜂群算法  混沌理论  Tent映射  自适应搜索  锦标赛选择策略
收稿时间:2013/10/25 0:00:00
修稿时间:8/4/2014 12:00:00 AM

Artificial bee colony algorithm based on self-adaptive Tent chaos search
KUANG Fang-jun,XU Wei-hong and JIN Zhong.Artificial bee colony algorithm based on self-adaptive Tent chaos search[J].Control Theory & Applications,2014,31(11):1502-1509.
Authors:KUANG Fang-jun  XU Wei-hong and JIN Zhong
Affiliation:School of Computer Science and Engineering, Nanjing University of Science and Technology; Department of Electronic and Information Engineering, Hunan Vocational Institute of Safety & Technology,School of Computer Science and Engineering, Nanjing University of Science and Technology; College of Computer and Communications Engineering, Changsha University of Science and Technology,School of Computer Science and Engineering, Nanjing University of Science and Technology
Abstract:In order to improve the performance of artificial bee colony (ABC) algorithm, a novel ABC algorithm based on self-adaptive Tent chaos search which is combined with Tent chaos algorithm is proposed. The algorithm uses Tent chaos mapping to improve the convergence characteristics and prevent the ABC to get stuck on local solutions. In this algorithm, Tent mapping is applied to diversify the initial individuals in the search space. Tent chaotic sequence based an optimal location is produced, and the self-adaptive adjustment of chaos search scopes can obtain the global optima. Experiments on six complex benchmark functions with high-dimension, simulation results further demonstrate that, the improved algorithm not only accelerates the convergence rate and improves solution precision. Compared with other latest improved artificial colony algorithm, it has a better overall performance, especially for complex high-dimensional functions optimization.
Keywords:artificial bee colony  chaos theory  Tent mapping  self-adapting search  tournament selection strategy
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《控制理论与应用》浏览原始摘要信息
点击此处可从《控制理论与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号