检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]南京旅游职业学院酒店管理学院,南京211100 [2]南京大学计算机科学与技术系,南京210093
出 处:《计算机应用》2014年第8期2299-2305,共7页journal of Computer Applications
基 金:国家自然科学基金资助项目(61272219;61100110;61021062);国家863计划项目(2007AA01Z334);江苏省科技计划项目(BE2010072;BE2011058;BY2012190)
摘 要:针对人工蜂群(ABC)算法存在收敛速度慢、求解精度不高、容易陷入局部最优等问题,利用蜂群觅食过程中先由侦察蜂进行四处侦察食物,并利用蜂群搜索构建精英群体指导蜂群觅食寻优。据此,提出了一种模拟侦察蜂侦察觅食行为的基于精英蜂群搜索策略的连续优化算法。算法利用构建精英蜂群策略、改进侦察蜂搜索机制以及基于目标函数值选择寻优三个主要策略加强算法的搜索机制。数值实验表明,所提算法不仅寻优精度和寻优率非常高,且收敛速度快,并能适于高维空间的优化问题。There are some problems in the Artificial Bee Colony (ABC) algorithm, such as the slow convergence speed, low solution precision and easy to fall in local optimum. In this paper, the scout bees firstly explored the food source by a random motivation. Along with the process of colony bee foraging behavior, the elite swarm was constructed to guide the colony bee to achieve better solutions. Hence, the paper proposed a continuous optimization algorithm based on elite swarm search strategy, which simulated the foraging behavior of scout bees. The search mechanism of the algorithm was enhanced by constructing elite swarm strategy, improving the scout bee search mechanism and selecting the best solution based on the objective function value. The numerical experiment results show that the proposed algorithm has high searching precision, success rate and fast convergence speed. It is also suitable for solving high-dimensional space optimization problems.
关 键 词:侦察蜂 精英蜂群 人工蜂群算法 全局侦察 函数优化
分 类 号:TP18[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.17.185.36