蝙蝠算法研究及应用综述

蝙蝠算法（BA）是一种受蝙蝠利用超声波回声定位觅食行为启发的新型群体智能优化算法。介绍了蝙蝠算法的基本原理，分析了性能影响因素，论述了算法的改进策略，并阐述了蝙蝠算法在数据挖掘、图像处理、组合优化等方面的应用与发展。最后结合蝙蝠算法的性能特点和应用方向，对蝙蝠算法未来的研究发展方向进行了展望。     

基于模拟退火高斯扰动的蝙蝠优化算法

蝙蝠算法（bat algorithm, BA）是一类新型的搜索全局最优解的随机优化技术。为了提高BA算法的搜索效果, 把模拟退火的思想引入到蝙蝠优化算法中, 并对蝙蝠算法的某些个体进行高斯扰动, 提出了一种基于模拟退火的高斯扰动蝙蝠优化算法（SAGBA）。分别将蝙蝠优化算法、模拟退火粒子群算法、SAGBA在20个典型的基准测试函数中进行仿真对比, 结果表明SAGBA不仅增加了全局收敛性, 而且在收敛速度和精度方面均优于其他两种算法。     

Binary bat algorithm

Bat algorithm (BA) is one of the recently proposed heuristic algorithms imitating the echolocation behavior of bats to perform global optimization. The superior performance of this algorithm has been proven among the other most well-known algorithms such as genetic algorithm (GA) and particle swarm optimization (PSO). However, the original version of this algorithm is suitable for continuous problems, so it cannot be applied to binary problems directly. In this paper, a binary version of this algorithm is proposed. A comparative study with binary PSO and GA over twenty-two benchmark functions is conducted to draw a conclusion. Furthermore, Wilcoxon’s rank-sum nonparametric statistical test was carried out at 5 % significance level to judge whether the results of the proposed algorithm differ from those of the other algorithms in a statistically significant way. The results prove that the proposed binary bat algorithm (BBA) is able to significantly outperform others on majority of the benchmark functions. In addition, there is a real application of the proposed method in optical engineering called optical buffer design at the end of the paper. The results of the real application also evidence the superior performance of BBA in practice.     

一种高效的混合蝙蝠算法

针对基本蝙蝠算法存在收敛速度慢,易陷入局部最优,求解精度低等缺陷,提出一种融合局部搜索的混合蝙蝠算法用于求解无约束优化问题。该算法利用混沌序列对蝙蝠的位置和速度进行初始化,为全局搜索的多样性奠定基础;融合Powell搜索以增强算法的局部搜索能力,加快收敛速度;使用变异策略在一定程度上避免算法陷入局部最优。选取几个标准测试函数进行仿真实验,结果表明：与基本蝙蝠算法和粒子群优化算法相比,混合蝙蝠算法具有更好的寻优性能。     

基于WS小世界模型的蝙蝠优化算法

蝙蝠算法是在对微型蝙蝠回声观察研究的基础上发现蝙蝠回声和优化目标功能之间的关系而提出的一种新算法。蝙蝠算法具有强大的搜索性能,但是其局部搜索相对简单,个体间缺乏信息互通,搜索能力差。尽管目前也提出了一些相关改进算法,但高维优化方面较少涉及。考虑到蝙蝠群体中个体相互联系与作用的方式有动态复杂的感知网络结构,具有“小世界”特性,所以首先把有“小世界”特性的WS小世界模型引入蝙蝠算法,利用WS小世界模型断边重连的特点生成动态的邻域结构,这种邻域结构能够提高整体的搜索能力。实例验证表明借助一般的蝙蝠算法可以进行局部搜索。     

A new modification approach on bat algorithm for solving optimization problems

Optimization can be defined as an effort of generating solutions to a problem under bounded circumstances. Optimization methods have arisen from a desire to utilize existing resources in the best possible way. An important class of optimization methods is heuristic algorithms. Heuristic algorithms have generally been proposed by inspiration from the nature. For instance, Particle Swarm Optimization has been inspired by social behavior patterns of fish schooling or bird flocking. Bat algorithm is a heuristic algorithm proposed by Yang in 2010 and has been inspired by a property, named as echolocation, which guides the bats’ movements during their flight and hunting even in complete darkness. In this work, local and global search characteristics of bat algorithm have been enhanced through three different methods. To validate the performance of the Enhanced Bat Algorithm (EBA), standard test functions and constrained real-world problems have been employed. The results obtained by these test sets have proven EBA superior to the standard one. Furthermore, the method proposed in this study is compared with recently published studies in the literature on real-world problems and it is proven that this method is more effective than the studies belonging to other literature on this sort of problems.     

带时间窗物流配送车辆路径问题的蝙蝠算法

带时间窗车辆路径问题（Vehicle Routing Problem with Time Windows,VRPTW）是一个重要而实际的研究课题,该问题在有能力约束模型的基础上增加了时间约束,要求配送系统总费用最低。蝙蝠算法（Bat Algorithm,BA）是一种新型的智能优化算法,目前尚未被应用到求解VRPTW问题中。根据VRPTW问题的数学模型及其具体特征,重新设计了BA的操作算子,给出了求解VRPTW问题的改进蝙蝠算法,并通过仿真实例和与其他算法进行比较的方式,验证了蝙蝠算法在VRPTW问题中的求解性能,拓展了蝙蝠算法的应用领域。     

Bat Algorithm: A Survey of the State-of-the-Art

The area of metaheuristic optimization algorithms has been attracting researchers for many years. These algorithms have built in capability to explore a large region of the solution space, are computationally robust, efficient and can avoid premature convergence. They have been extensively tested and applied on many hard optimization problems where conventional computing techniques perform unsatisfactorily. They are capable of solving general N-dimensional, linear, nonlinear and complex global optimization problems. One of the latest entrants in this field is the Bat algorithm which is based on the echolocation behaviour of bats. It has been proven to have good convergence properties on different benchmark functions and seems promising for dealing with optimization problems. The aim of this paper is to provide a survey of the state of the art on Bat algorithm. A concise effort has been made so that the readers get a rapid insight into some of the applications upon which bat algorithm has been applied till date in specialized fields of science and engineering. Some of the variants of the bat algorithm as reported in the literature have also been discussed.     

Application of mutation operators to flower pollination algorithm

Flower pollination algorithm (FPA) is a recent addition to the field of nature inspired computing. The algorithm has been inspired from the pollination process in flowers and has been applied to a large spectra of optimization problems. But it has certain drawbacks which prevents its applications as a standard algorithm. This paper proposes new variants of FPA employing new mutation operators, dynamic switching and improved local search. A comprehensive comparison of proposed algorithms has been done for different population sizes for optimizing seventeen benchmark problems. The best variant among these is adaptive-Lévy flower pollination algorithm (ALFPA) which has been further compared with the well-known algorithms like artificial bee colony (ABC), differential evolution (DE), firefly algorithm (FA), bat algorithm (BA) and grey wolf optimizer (GWO). Numerical results show that ALFPA gives superior performance for standard benchmark functions. The algorithm has also been subjected to statistical tests and again the performance is better than the other algorithms.     

Neighborhood Search Based Improved Bat Algorithm for Web Service Composition

Web services are provided as reusable software components in the services-oriented architecture. More complicated composite services can be combined from these components to satisfy the user requirements represented as a workflow with specified Quality of Service (QoS) limitations. The workflow consists of tasks where many services can be considered for each task. Searching for optimal services combination and optimizing the overall QoS limitations is a Non-deterministic Polynomial (NP)-hard problem. This work focuses on the Web Service Composition (WSC) problem and proposes a new service composition algorithm based on the micro-bats behavior while hunting the prey. The proposed algorithm determines the optimal combination of the web services to satisfy the complex user needs. It also addresses the Bat Algorithm (BA) shortcomings, such as the tradeoff among exploration and exploitation searching mechanisms, local optima, and convergence rate. The proposed enhancement includes a developed cooperative and adaptive population initialization mechanism. An elitist mechanism is utilized to address the BA convergence rate. The tradeoff between exploration and exploitation is handled through a neighborhood search mechanism. Several benchmark datasets are selected to evaluate the proposed bat algorithm’s performance. The simulation results are estimated using the average fitness value, the standard deviation of the fitness value, and an average of the execution time and compared with four bat-inspired algorithms. It is observed from the simulation results that introduced enhancement obtains significant results.     

来自大自然的寻优策略：像蝙蝠一样感知

蝙蝠算法是受自然界中的蝙蝠通过回声定位进行搜寻、捕食猎物行为的启发,并将多智能体系统与进化机制相结合发展而来的优化方法。作为一种新颖的仿生群体智能优化算法,分析了蝙蝠算法的仿生原理、优化机理及特点,对算法优化过程进行了定义。通过标准算例对蝙蝠算法在连续空间和离散空间的优化性能进行了仿真测试,结果表明该算法在函数优化和组合优化方面应用的可行性和有效性,具有良好的应用前景。     

Robust adaptive control of a bio-inspired robot manipulator using bat algorithm

This paper proposes a novel adaptive fractional order PID sliding mode controller (AFOPIDSMC) using a Bat algorithm to control of a Caterpillar robot manipulator. A fractional order PID (FOPID) control is applied to improve both trajectory tracking and robustness. Sliding mode controller (SMC) is one of the control methods which provides high robustness and low tracking error. Using hybridization, a new combined control law is proposed for chattering reduction by means of FOPID controller and high trajectory tracking through using SMC. Then, an adaptive controller design motivated from the SMC is applied for updating FOPID parameters. A metaheuristic approach, the Bat search algorithm based on the echolocation behavior of bats is applied for optimal design of the Caterpillar robot in order to tune the parameter AFOPIDSMC controllers (BA-AFOPIDSMC). To study the effectiveness of Bat algorithm, its performance is compared with five other controllers such as PID, FOPID, SMC, AFOPIDSMC and PSO-AFOPIDSMC. The stability of the AFOPIDSMC controller is proved by Lyapunov theory. Numerical simulation results completely indicate the advantage of BA-AFOPIDSMC for trajectory tracking and chattering reduction.     

基于蝙蝠拟牛顿混合算法的无线传感器网络节点定位

针对距离矢量-跳数(DV-Hop)算法第三阶段中最小二乘法定位精度低的问题,提出一种蝙蝠-拟牛顿混合算法与DV-Hop算法融合的定位算法.首先对蝙蝠算法进行两点改进:1)根据蝙蝠个体的适应度值自适应调节随机向量β,使得脉冲频率具有自适应能力;2)利用当前迭代之前所有最优个体的平均位置来引导蝙蝠移动,使得速度具有变异性能;然后在DV-Hop算法第三阶段采用改进蝙蝠算法得出节点的估计位置,再利用拟牛顿算法以估计位置为初始点继续搜索节点位置.仿真结果表明:相比传统DV-Hop算法和基于蝙蝠算法的DV-Hop改进算法(BADV-Hop),该算法的定位精度大约提高了16.5%、5.18%,且稳定性更好,适用于定位精度和稳定性要求较高的场合.     

Community detection from biological and social networks: A comparative analysis of metaheuristic algorithms

In order to analyze complex networks to find significant communities, several methods have been proposed in the literature. Modularity optimization is an interesting and valuable approach for detection of network communities in complex networks. Due to characteristics of the problem dealt with in this study, the exact solution methods consume much more time. Therefore, we propose six metaheuristic optimization algorithms, which each contain a modularity optimization approach. These algorithms are the original Bat Algorithm (BA), Gravitational Search Algorithm (GSA), modified Big Bang–Big Crunch algorithm (BB-BC), improved Bat Algorithm based on the Differential Evolutionary algorithm (BADE), effective Hyperheuristic Differential Search Algorithm (HDSA) and Scatter Search algorithm based on the Genetic Algorithm (SSGA). Four of these algorithms (HDSA, BADE, SSGA, BB-BC) contain new methods, whereas the remaining two algorithms (BA and GSA) use original methods. To clearly demonstrate the performance of the proposed algorithms when solving the problems, experimental studies were conducted using nine real-world complex networks − five of which are social networks and the rest of which are biological networks. The algorithms were compared in terms of statistical significance. According to the obtained test results, the HDSA proposed in this study is more efficient and competitive than the other algorithms that were tested.     

基于SAGBA优化粒子滤波的目标跟踪

在目标跟踪领域,粒子滤波技术有处理非线性非高斯问题的优势,但是标准粒子滤波在利用重采样方法解决退化现象时,会产生粒子贫化现象,导致滤波精度不稳定。针对这个问题,利用融合了模拟退火高斯扰动的蝙蝠算法对粒子滤波进行优化改进。该算法将粒子表征为蝙蝠个体,蝙蝠种群通过调节蝙蝠个体的频率、响度和脉冲发射率,伴随当前最优蝙蝠个体在目标图像区域进行搜索,并且可以对全局搜索和局部搜索进行动态决策,从而提高蝙蝠个体整体的质量与合理的分布;融合的模拟退火高斯扰动策略可以增强算法跳出局部最优的能力。为了验证该算法的优化性能,将该算法和标准粒子滤波算法进行性能分析对比。实验结果表明该算法的滤波性能优于标准粒子滤波算法。     

BA-PNN-based methods for power transformer fault diagnosis

This paper presents a machine learning-based approach to power transformer fault diagnosis based on dissolved gas analysis (DGA), a bat algorithm (BA), optimizing the probabilistic neural network (PNN). PNN is a radial basis function feedforward neural network based on Bayesian decision theory, which has a strong fault tolerance and significant advantages in pattern classification. However, one challenge still remains: the performance of PNN is greatly affected by its hidden layer element smooth factor which impacts the classification performance. The proposed approach addresses this challenge by deploying the BA algorithm, a kind of bio-inspired algorithm to optimize PNN. Using the real data collected from a transformer system, we conducted the experiments for validating the performance of the developed method. The experimental results demonstrated that BA is an effective algorithm for optimizing PNN smooth factor and BA-PNN can improve the fault diagnosis performance; in turn, and the machine learning-based model (BA-PNN) can significantly enhance the accuracies of power transformer fault diagnosis.     

Harris Hawk Optimization Algorithm Based on Cauchy Distribution Inverse Cumulative Function and Tangent Flight Operator

Harris Hawk Optimization (HHO) algorithm is a new population-based and nature-inspired optimization paradigm, which has strong global search ability, but its diversified local search strategies easily make it fall into local optimum. In order to enhance its search mechanism and speed of convergence, an new improved HHO algorithm based on the inverse cumulative function operator of Cauchy distribution and tangent flight operator was proposed. The proposed two operators are used as scale factors to control the step size. The walk path of Cauchy inverse cumulative integral function shows that its trajectory step length is relative to the average, which can further enhance the search stability of the algorithm. The Tangent flight has the function of balanced exploitation and exploration, and enhances the convergence ability of the algorithm. In order to verify the performance of the proposed algorithm, the 30 benchmark functions of the 2017 Institute of Electrical and Electronic Engineers (IEEE) Conference on Evolutionary Computation (CEC2017) and two practical engineering design problems are adopted to carry out the simulation experiments. On the other hand, the covariance matrix adaptation evolutionary strategies (CMA-ES), arithmetic optimization algorithm (AOA), butterfly optimization algorithm (BOA), bat algorithm (BA), whale optimization algorithm (WOA), sine cosine algorithm (SCA), and the proposed HHO algorithms were used for comparison experiments. Simulation results show that the proposed the Cauchy-distribution and Tangent-Flight Harris Hawk Optimization (CTHHO) Algorithm has strong optimization capability.

     

改进蝙蝠算法在模糊层次分析中的应用

为了解决基本蝙蝠算法易发生早熟收敛、求解精度较低等问题,提出并实现了旨在提高群体多样性的改进算法.首先在蝙蝠算法中引入速度权重因子,令其在迭代过程中线性递减;其次在局部新解不满足接受条件时,对蝙蝠位置进行Cauchy分布随机数扰动,并在算法运行中间隔性调用非线性规划函数.改进算法能在寻优过程中保持群体多样性,增强全局搜索和局部搜索能力.标准函数测试及在模糊层次分析中的应用结果表明,改进蝙蝠算法的性能远优于基本蝙蝠算法,具有较好的实用价值.     

动态权重的蝙蝠算法在图像分割中的应用研究

传统的最小交叉熵阈值分割法（MCET）采用穷举的搜索形式，存在计算复杂度大、分割效率低的缺点，在很大程度上限制了该方法的应用。针对最小交叉熵分割法存在的不足，提出采用改进蝙蝠算法（BA）来搜索阈值的最优解。对BA算法中的权重参数做自适应调整，将随着迭代次数变化而变化的时变惯性权重策略应用于BA算法更新公式，给出三种不同的改进策略解决原始BA算法在靠近最优解时收敛速度下降的问题。将改进后的最优BA算法（IBA）应用于最小交叉熵多阈值图像分割中，与基本BA算法、改进的粒子群优化算法（IPSO）、模糊聚类方法（FC）三种方法进行对比性实验。实验结果表明，提出的IBA算法运算速度和分割精度效果明显提升。     

Bat algorithm for constrained optimization tasks

In this study, we use a new metaheuristic optimization algorithm, called bat algorithm (BA), to solve constraint optimization tasks. BA is verified using several classical benchmark constraint problems. For further validation, BA is applied to three benchmark constraint engineering problems reported in the specialized literature. The performance of the bat algorithm is compared with various existing algorithms. The optimal solutions obtained by BA are found to be better than the best solutions provided by the existing methods. Finally, the unique search features used in BA are analyzed, and their implications for future research are discussed in detail.