人工蜂群算法综述

人工蜂群算法是Karaboga在2005年提出的一种基于蜜蜂觅食行为的群体智能算法,该算法可以很好地解决连续函数的求解问题,后因其强大的性能深受研究者的青睐,得以广泛的研究和应用。本文首先简要介绍了群体智能和人工蜂群算法的发展,然后详细介绍了人工蜂群算法的原理及实现步骤,最后综述近十年来国内外对该算法及其应用的研究状况,进而总结出该算法具有控制参数少、强鲁棒性等优点,并指出该算法时间复杂度略高的基本事实,可成为今后改进的研究方向。     

人工蜂群算法综述

近年来群智能算法发展较为迅速并解决了很多大规模的复杂问题.人工蜂群算法是一种新型的群智能算法,以其很强的全局收敛性、贪婪启发式的搜索特征以及求解问题的快速性等优越的性能受到广泛关注.简单介绍了人工蜂群算法提出的生物学背景;由蜜蜂觅食行为与现实问题的求解类比给出了该算法的建模思想;并详细介绍了人工蜂群算法实现的算法模型;从基于算法的改进以及基于算法的应用两方面讨论了近年来很多学者对人工蜂群算法研究的现状;最后对人工蜂群算法的研究进行展望,从算法的弱点分析提出了该算法改进的方向以及进一步应用的领域.     

改进的人工蜂群算法在神经网络中的应用

人工蜂群算法是模拟蜜蜂采蜜行为而提出的一种新的启发式仿生算法,属于典型的群体智能算法。提出了一种改进的人工蜂群算法,并利用改进后的人工蜂群算法来优化传统BP算法(神经网络算法中的误差方向传播算法)中网络参数的权值。实验结果证明该优化算法提高了BP神经网络收敛解的精度,加快了BP神经网络收敛速度。     

多目标人工蜂群算法研究

人工蜂群算法是一种模仿蜜蜂采蜜行为的新兴群体智能算法.本文在人工蜂群算法的基础上采用多目标进化算法中的Pareto非劣排序和个体密度值的概念并借鉴粒子群算法,引入全局最优解记录全局最优位置,提出了一个基于Pareto占优的多目标人工蜂群算法.最后验证了算法的可行性.     

蜂群算法

蜂群算法是一种非数值优化计算方法,建立在蜜蜂自组织型与群体智能基础之上,是近几年比较热门的智能算法。本文主要介绍了蜂群算法的研究背景、基本原理、要素构成、算法流程和优缺点等现状,并对蜂群算法存在的问题进行了一些讨论,在此基础上提出了未来蜂群算法的发展方向。     

新型群智能优化算法综述

传统群智能算法在解决复杂实际多目标优化问题中存在不足,近年来学者提出诸多新型群智能算法,适用性强,在求解复杂实际问题中取得了较好的实验效果。以算法提出时间为主线,对新型群智能算法中细菌觅食优化算法、混合蛙跳算法、人工蜂群算法、萤火虫算法、布谷鸟搜索、果蝇优化算法和头脑风暴优化算法的改进及应用进行分析和综述,并对群智能算法未来的研究发展方向进行了探讨。     

群体智能算法在图像分割中的应用综述

图像分割的通用方法一直是图像处理领域中的热点和难点。随着人工智能的兴起和发展,群体智能算法成为当下热点研究的方向,将图像分割技术结合群体智能算法成为一种新型有效的改进方法。群智能算法通过模拟自然界的事物或生物的行动规律,将传统的人工智能和群体生物结合,在解空间中搜索最优解,为解决复杂问题提供了新的解决思路。阐述群体智能算法的研究现状和发展过程,将早期的蚁群算法（Ant Colony Optimization,ACO）、经典的粒子群算法（Particle Swarm Optimization Algorithm,PSO）以及较新的麻雀搜索算法（Sparrow Search Algorithm,SSA）为例详细介绍其算法原理方法,并简要表述蝙蝠算法（Bat Algorithm,BA）、鲸鱼优化算法（Whale Optimization Algorithm,WOA）、人工蜂群算法（Artificial Bee Colony Algorithm,ABC）、萤火虫算法（Firefly Algorithm,FA）、布谷鸟搜索法（Cuckoo Search,CS）、细菌觅食算法（Bacterial Foraging Optimization,BFO）和最新的蜉蝣算法（Mayfly Algorithm,MA）的原理,在此基础上,结合国内外文献对上述算法的改进方法和结合图像分割技术的综合改进及应用进行分析总结。将群体智能算法结合图像分割技术的代表性算法提取出来进行列表分析总结,随后概述总结群体智能算法的统一框架、共同特性、不同的差异并提出存在的问题,最后对未来趋势做出展望。     

融合BFGS的自适应蜂群算法在谐波平衡分析中的应用

针对谐波平衡分析中传统算法存在初值限制,以及智能算法收敛速度慢的缺点,提出一种基于BFGS（Broyden-Fleteher-Goldfarl-Shanno）算法局部搜索策略的自适应蜂群算法。该算法在基本蜂群算法的基础上引入非线性的动态调整因子代替蜂群算法搜索公式中的随机变量,增加搜索的自适应性,并将BFGS算法运用到自适应蜂群算法后期求解,提高其局部搜索能力。实验结果表明,改进算法较标准蜂群算法迭代次数减少51.9%,相对于传统BFGS算法和部分改进智能算法均表现出较好收敛性能。     

基于改进蜂群算法的存储阵列寿命均衡算法

为提升航电系统存储阵列可靠性和硬盘使用寿命，研究航电存储阵列中各硬盘剩余寿命的关联因素并进行建模分析，在原有的人工蜂群算法(artificial bee colony algorithm, ABC)基础上，提出一种改进蜂群算法，通过数据读写负载在硬盘间的合理分配，实现存储阵列中各硬盘寿命均衡，通过对侦查蜂的行为逻辑进行改进，进一步提高蜂群算法的优化速度和收敛性能。通过MATLAB仿真模拟实验，将改进蜂群算法与传统的智能算法进行对比，在多种初始工况条件下对该算法进行验证。仿真实验结果表明，改进算法可以适应多种工况并迅速实现存储阵列的负载分配和寿命均衡，与传统智能算法相比具有更好的优化效果和收敛能力。     

人工蜂群算法在带约束圆形布局问题中的应用

人工蜂群算法是一种基于蜜蜂采蜜机制的新型演化算法。给出了带平衡约束的圆形布局问题的数学模型,介绍了人工蜂群算法的基本过程以及计算流程,将人工蜂群算法应用于带平衡约束的圆形布局优化中。通过两个实例进行仿真计算,并将计算结果与文献结果比较,验证了人工蜂群算法是解决此类问题的一种有效且实用的群智能算法。     

群智能算法的研究进展

群智能是一种仿生自然界动物昆虫觅食筑巢行为的新兴演化计算技术。目前主要的群智能优化算法有蚁群算法、微粒群算法和人工鱼群算法。本文介绍了群智能算法的产生、发展和优点,并着力阐述了上述三种典型算法的基本原理,同时概述了各算法的应用现状,最后提出了算法将来有待研究的内容。     

Artificial bee colony algorithm with memory

Artificial bee colony algorithm (ABC) is a new type of swarm intelligence methods which imitates the foraging behavior of honeybees. Due to its simple implementation with very small number of control parameters, many efforts have been done to explore ABC research in both algorithms and applications. In this paper, a new ABC variant named ABC with memory algorithm (ABCM) is described, which imitates a memory mechanism to the artificial bees to memorize their previous successful experiences of foraging behavior. The memory mechanism is applied to guide the further foraging of the artificial bees. Essentially, ABCM is inspired by the biological study of natural honeybees, rather than most of the other ABC variants that integrate existing algorithms into ABC framework. The superiority of ABCM is analyzed on a set of benchmark problems in comparison with ABC, quick ABC and several state-of-the-art algorithms.     

蜂群算法研究综述*

蜂群算法是一种模仿蜜蜂繁殖、采蜜等行为的新兴的群智能优化技术,近几年备受研究者关注。初步探讨了蜂群算法的理论基础,详细论述了基于蜜蜂繁殖行为和采蜜行为的两类蜂群算法的生物学机理及其最常见算法的应用研究情况,并分析比较了遗传算法、蚁群算法、粒子群算法和蜂群算法的优缺点、适用范围及性能。最后,总结了现有蜂群算法存在的问题,并指出其未来的研究方向。     

Performance assessment of foraging algorithms vs. evolutionary algorithms

The class of foraging algorithms is a relatively new field based on mimicking the foraging behavior of animals, insects, birds or fish in order to develop efficient optimization algorithms. The artificial bee colony (ABC), the bees algorithm (BA), ant colony optimization (ACO), and bacterial foraging optimization algorithms (BFOA) are examples of this class to name a few. This work provides a complete performance assessment of the four mentioned algorithms in comparison to the widely known differential evolution (DE), genetic algorithms (GAs), harmony search (HS), and particle swarm optimization (PSO) algorithms when applied to the problem of unconstrained nonlinear continuous function optimization. To the best of our knowledge, most of the work conducted so far using foraging algorithms has been tested on classical functions. This work provides the comparison using the well-known CEC05 benchmark functions based on the solution reached, the success rate, and the performance rate.     

Bacterial Foraging Optimization Approach to Portfolio Optimization

In this paper we propose a heuristic approach based on bacterial foraging optimization (BFO) in order to find the efficient frontier associated with the portfolio optimization (PO) problem. The PO model with cardinality and bounding constraints is a mixed quadratic and integer programming problem for which no exact algorithms can solve in an efficient way. Consequently, various heuristic algorithms, such as genetic algorithms and particle swarm optimization, have been proposed in the past. This paper aims to examine the potential of a BFO algorithm in solving the PO problem. BFO is a new swarm intelligence technique that has been successfully applied to several real world problems. Through three operations, chemotaxis, reproduction, and elimination-dispersal, the proposed BFO algorithm can effectively solve a PO problem. The performance of the proposed approach was evaluated in computational tests on five benchmark data sets, and the results were compared to those obtained from existing heuristic algorithms. The proposed BFO algorithm is found to be superior to previous heuristic algorithms in terms of solution quality and time.     

Composite artificial bee colony algorithms: From component-based analysis to high-performing algorithms

The artificial bee colony (ABC) algorithm is a swarm intelligence algorithm inspired by the intelligent foraging behavior of a honeybee swarm. In recent years, several ABC variants that modify some components of the original ABC algorithm have been proposed. Although there are some comparison studies in the literature, the individual contribution of each proposed modification is often unknown. In this paper, the proposed modifications are tested with a systematic experimental study that by a component-wise analysis tries to identify their impact on algorithm performance. This study is done on two benchmark sets in continuous optimization. In addition to this analysis, two new variants of ABC algorithms for each of the two benchmark sets are proposed. To do so, the best components are selected for each step of the Composite ABC algorithms. The performance of the proposed algorithms were compared against that of ten recent ABC algorithms, as well as against several recent state-of-the-art algorithms. The comparison results showed that our proposed algorithms outperform other ABC algorithms. Moreover, the composite ABC algorithms are superior to several state-of-the-art algorithms proposed in the literature.     

Swarm intelligence based routing protocol for wireless sensor networks: Survey and future directions

Swarm intelligence is a relatively novel field. It addresses the study of the collective behaviors of systems made by many components that coordinate using decentralized controls and self-organization. A large part of the research in swarm intelligence has focused on the reverse engineering and the adaptation of collective behaviors observed in natural systems with the aim of designing effective algorithms for distributed optimization. These algorithms, like their natural systems of inspiration, show the desirable properties of being adaptive, scalable, and robust. These are key properties in the context of network routing, and in particular of routing in wireless sensor networks. Therefore, in the last decade, a number of routing protocols for wireless sensor networks have been developed according to the principles of swarm intelligence, and, in particular, taking inspiration from the foraging behaviors of ant and bee colonies. In this paper, we provide an extensive survey of these protocols. We discuss the general principles of swarm intelligence and of its application to routing. We also introduce a novel taxonomy for routing protocols in wireless sensor networks and use it to classify the surveyed protocols. We conclude the paper with a critical analysis of the status of the field, pointing out a number of fundamental issues related to the (mis) use of scientific methodology and evaluation procedures, and we identify some future research directions.     

交互变邻域微分进化群搜索优化算法

群搜索优化算法(Group Search Optimizer,GSO)具有广泛的生物学背景,特别是引入动物的视觉搜索机制,并且同一些已有的群智能算法相比较,在高维多峰问题上有更好的效果.但算法在个体觅食策略的选择上以及整个动物群体间信息共享的网络拓扑结构来看,存在错过最优值和信息交流模式过于简单的缺陷.受NW模型的启发,同时采用动态采样的方式提出了交互变邻域微分进化群搜索优化算法(Interactive Dynamic Neighborhood Differential Evolutionary GSO,IDGSO),并采用均匀设计和线性回归方法对参数进行选择,4个标准测试函数表明了IDGSO的有效性.     

Performance comparison of bio-inspired optimization algorithms for Sierpinski gasket fractal antenna design

The Sierpinski gasket fractal antenna is most popular structure in the domain of fractal antennas. This fractal antenna has multi-band performance, and hence, the design of this antenna for the desired frequencies is a challenging problem. The artificial intelligence tools like artificial neural networks, fuzzy logic systems, bio-inspired optimization techniques are appropriate to provide accurate design solution in such cases. In this paper, three most popular bio-inspired optimization algorithms: genetic algorithms, particle swarm optimization (PSO), and bacterial foraging optimization, have been proposed to solve the design issues of Sierpinski gasket pre-fractal antenna. Their performances are analyzed and are compared with the experimental results. A simplified expression for calculation of resonant frequency of Sierpinski gasket pre-fractal antenna is proposed and is used as the objective function. Finally, the effectiveness is compared on the basis of three different measures: mean absolute percentage error, the average time taken by the models to evaluate the results, and the coefficient of correlation. The results indicate that the PSO algorithm is most suitable for this type of antenna.