混合迁移的高效BBO算法及其在图像分割中的应用

针对高维多阈值分割由于维数增加带来的优化难度加大的问题以及标准生物地理学优化(biogeography-based optimization,BBO)算法效率不高的问题,提出了一种用于高维OTSU多阈值分割的高效生物地理学优化(efficient BBO,EBBO)算法。首先构建新型随机扰动变异算子,然后将此变异算子融合到启发式迁移算子中形成一种高性能的混合迁移算子,去掉了计算变异概率和设置变异参数等环节,以便提高算法的效率;其次将基于迁出率的赌轮选择方式改成无需迁出率的榜样学习选择方案,并将迁入率的多次计算变成一次计算,进一步提高算法的效率;然后将BBO算法中的精英保留方案换成贪婪选择方法,以加快算法的收敛速度;最后将这种EBBO算法应用到高维OTSU多阈值分割中。实验结果表明,与当前的EBO算法、BDE算法、MKTO算法以及BBO算法相比,EBBO算法在高维多阈值分割中不仅有更好的优化性能和更快的运行速度,而且减少了参数设置。     

基于人工萤火虫局部决策域的改进生物地理学优化算法

针对生物地理学优化（BBO）算法搜索能力不足的缺点,提出基于萤火虫算法局部决策域策略的改进迁移操作来提算法的全局寻优能力。改进的迁移操作能够在考虑不同栖息地各自的迁入率与迁出率的基础上,进一步利用栖息地之间的相互影响关系。将改进算法应用于12个典型的函数优化问题来测试改进生物地理学优化算法的性能,验证了改进算法的有效性。与BBO、改进BBO（IBBO）、基于差分进化的BBO（DE/BBO）算法的实验结果表明,改进算法提高了算法的全局搜索能力、收敛速度和解的精度。     

基于中值迁移和柯西变异的生物地理学算法

针对生物地理学优化算法(biogeography-based optimization,BBO)收敛速度慢和容易陷入局部最优解的问题,提出一种基于中值迁移和柯西变异的生物地理学优化算法(MCBBO).在MCBBO中,设计了基于中值定理的迁移算子,以扩大栖息地的分布范围,实现更精确的迁移;同时,采用柯西变异增加算法摆脱局部极值的能力.基于标准测试函数仿真实验表明,MCBBO算法优化得到的解更接近理论最优解,算法收敛速度更快,表明了MCBBO算法的有效性.     

一种改进的生物地理学优化算法

生物地理学优化算法（BBO）作为一种新型的智能算法,在其提出不到十年的时间内受到学界的广泛关注和研究,并显示出了广阔的应用前景。为了提高算法的优化性能,对BBO算法提出一种改进,该算法在将差分优化算法（DE）中的局部搜索策略同BBO算法中的迁移策略相结合的基础上,针对迁移算子和变异算子分别进行改进,提出了二重迁移算子和二重变异算子,使得栖息地个体在进化过程中得到更高的进化概率,从而使得算法的寻优能力得到进一步提升。通过6个高维函数的测试,结果表明该算法在优化高维优化问题时,较其他几种生物地理学优化算法具有更好的收敛性和稳定性。     

基于混合凸迁移和趋优柯西变异的对偶生物地理学优化算法

通过分析生物地理学优化算法(BBO)性能的不足,提出了一种基于混合凸迁移和趋优柯西变异的对偶生物地理学优化算法(DuBBO).在迁移算子中,采用动态的混合凸迁移算子,使算法能够快速地向最优解方向收敛;在变异机制中,采用趋优变异策略,并加入了柯西分布随机数帮助算法跳出局部最优解;最后将对偶学习策略集成到算法中,加快了算法收敛速度并提升了搜索能力.在23个benchmark函数上的实验结果证明了提出的三种改进策略的有效性和必要性.最后将DuBBO与BBO以及另外六种优秀的改进算法进行对比.实验结果表明,DuBBO在整体性能上最好、收敛速度更快、收敛精度更高.     

改进迁移算子的BBO算法及其在PID参数中的优化

针对生物地理学优化（BBO）算法寻优过程中易陷入搜索动力不足、收敛精度不高等问题,提出一种基于改进迁移算子的生物地理学优化算法（IMO-BBO）。在BBO算法基础上,结合“优胜劣汰”的进化思想,将迁移距离作为影响因素对迁移算子进行改进,并用差分策略将不适宜迁移的个体进行替换,以增加算法的局部探索能力。同时为丰富物种的多样性,引入多种群概念。利用IMO-BBO算法分别对13个基准测试函数进行测试,与基于协方差迁移算子和混合差分策略的BBO （CMM-DE/BBO）算法和BBO算法相比,改进算法提高了对全局最优解的搜索能力,在收敛速度和精确度上也都有显著提高;将IMO-BBO算法应用到PID参数整定中,仿真结果表明,所提算法优化后的控制器具有更快的响应速度和更稳定的精度。     

引入物种演化的改进生物地理学优化算法

针对生物地理学优化算法(biogeography-based optimization, BBO)易早熟收敛、陷入局部最优的问题,引入物种演化理论提出了改进生物地理学优化算法。该算法将所有栖息地按照物种数量划分为三种地区,并建立协同进化关系,合理地采用区间入侵、区内合作/竞争策略,满足多样性的同时避免了早熟收敛。定义了物种更迭和物种进化两种变异策略,提出的双策略协同变异算子旨在解决变异算子对较优解的破坏。通过CEC2017中的八个基准测试函数与标准BBO及相关改进算法相比,该算法在算法性能、稳定性等方面优于BBO及其他改进算法,且该算法不易被局部最优值所限制。将该算法应用于以最大完工时间为目标的柔性作业车间调度问题(flexible Job-Shop scheduling problem, FJSP)以检验其实际应用价值,实验表明,该算法在解决FJSP上具有一定的有效性。     

一种群体迁移优化算法及性能分析

受生态系统中迁移机制的激发, 提出了一种基于群体迁移的优化算法. 该算法是根据生态学中群体分布的迁移模型而提出的一种新的优化算法. 借鉴其他智能算法思想, 用栖息地来表示优化问题的解集, 通过生物群体的迁入与迁出实现解集之间特征信息的共享, 从而完成进化过程. 该文讨论了基于群体迁移的优化算法基本原理和实现步骤, 同时进行一些基准函数的性能测试. 通过分析表明提出的新算法是有效的, 是一种具有潜在优越性的优 化算法.     

生物地理学优化算法综述

生物地理学(Biogeography)是一门研究自然界种群迁移机制的科学,Dan Simon用生物地理学的方法和机制来解决工程优化问题,提出了生物地理学优化算法(BBO,Biogeography-Based Optimization).生物地理学优化算法以其独特的搜索机制和较好的性能在智能优化算法领域得到了广泛的关注.对生物地理学优化算法的设计原理、迁徙模型、算法流程及相应迁移和突变操作进行了综述.通过BBO算法在14个基准函数下与传统算法,如遗传算法、蚁群算法和粒子群等优化算法的性能比较,表明生物地理学优化算法是有效的.论述了算法与传统优化算法之间的差异以及BBO算法有待解决的问题.     

基于迁出地动态选择与自适应迁入策略的BBO算法

Dan Simon用生物地理学的方法和机制来解决工程优化问题,提出了生物地理学优化算法(Biogeography-Based Optimization,BBO)。该算法因其独特的搜索机制和较好的性能在智能优化算法领域得到了广泛的关注。为了进一步提高生物地理学优化算法的全局和局部收索能力,提出了一种基于动态选择迁出地与混合自适应迁入的优化策略,对生物地理学优化算法进行改进,形成一种新的改进型BBO算法。该算法根据进化阶段动态选择待迁出地,并综合当前迁出地和随机迁出地优化迁入策略;同时,设计与适应度相关的变异机制,以增加算法的全局搜索能力。仿真实验结果表明,该算法在全局搜索、收敛速度和收敛精度上均优于对比算法。     

An analysis of the equilibrium of migration models for biogeography-based optimization

Motivated by the migration mechanisms of ecosystems, various extensions to biogeography-based optimization (BBO) are proposed here. As a global optimization method, BBO is an original algorithm based on the mathematical model of organism distribution in biological systems. BBO is an evolutionary process that achieves information sharing by biogeography-based migration operators. In BBO, habitats represent candidate problem solutions, and species migration represents the sharing of features between candidate solutions according to the fitness of the habitats. This paper generalizes equilibrium species count results in biogeography theory, explores the behavior of six different migration models in BBO, and investigates performance through 23 benchmark functions with a wide range of dimensions and diverse complexities. The performance study shows that sinusoidal migration curves provide the best performance among the six different models that we explored. In addition, comparison with other biology-based optimization algorithms is investigated, and the influence of the population size, problem dimension, mutation rate, and maximum migration rate of BBO are also studied.     

Blended biogeography-based optimization for constrained optimization

Biogeography-based optimization (BBO) is a new evolutionary optimization method that is based on the science of biogeography. We propose two extensions to BBO. First, we propose a blended migration operator. Benchmark results show that blended BBO outperforms standard BBO. Second, we employ blended BBO to solve constrained optimization problems. Constraints are handled by modifying the BBO immigration and emigration procedures. The approach that we use does not require any additional tuning parameters beyond those that are required for unconstrained problems. The constrained blended BBO algorithm is compared with solutions based on a stud genetic algorithm (SGA) and standard particle swarm optimization 2007 (SPSO 07). The numerical results demonstrate that constrained blended BBO outperforms SGA and performs similarly to SPSO 07 for constrained single-objective optimization problems.     

A hybrid biogeography-based optimization algorithm for job shop scheduling problem

In this paper, a hybrid biogeography-based optimization (HBBO) algorithm has been proposed for the job-shop scheduling problem (JSP). Biogeography-based optimization (BBO) is a new bio-inpired computation method that is based on the science of biogeography. The BBO algorithm searches for the global optimum mainly through two main steps: migration and mutation. As JSP is one of the most difficult combinational optimization problems, the original BBO algorithm cannot handle it very well, especially for instances with larger size. The proposed HBBO algorithm combines the chaos theory and “searching around the optimum” strategy with the basic BBO, which makes it converge to global optimum solution faster and more stably. Series of comparative experiments with particle swarm optimization (PSO), basic BBO, the CPLEX and 14 other competitive algorithms are conducted, and the results show that our proposed HBBO algorithm outperforms the other state-of-the-art algorithms, such as genetic algorithm (GA), simulated annealing (SA), the PSO and the basic BBO.     

Enhancing the performance of biogeography-based optimization using polyphyletic migration operator and orthogonal learning

Biogeography-based optimization (BBO) is a powerful population-based algorithm inspired by biogeography and has been extensively applied to many science and engineering problems. However, its direct-copying-based migration and random mutation operators make BBO possess local exploitation ability but lack global exploration ability. To remedy the defect and enhance the performance of BBO, an enhanced BBO variant, called POLBBO, is developed in this paper. In POLBBO, a proposed efficient operator named polyphyletic migration operator can formally utilize as many as four individuals’ features to construct a new solution vector. This operator cannot only generate new features from more promising areas in the search space, but also effectively increase the population diversity. On the other hand, an orthogonal learning (OL) strategy based on orthogonal experimental design is employed. The OL strategy can quickly discover more useful information from the search experiences and efficiently utilize the information to construct a more promising solution, and thereby provide a systematic and elaborate reasoning method to guide the search directions of POLBBO. The proposed POLBBO is verified on a set of 24 benchmark functions with diverse complexities, and is compared with the basic BBO, five state-of-the-art BBO variants, five existing OL-based algorithms, and nine other evolutionary algorithms. The experimental results and comparisons demonstrate that the polyphyletic migration operator and the OL strategy can work together well and enhance the performance of BBO significantly in terms of the quality of the final solutions and the convergence rate.     

An improved biogeography based optimization approach for segmentation of human head CT-scan images employing fuzzy entropy

The present paper proposes the development of a three-level thresholding based image segmentation technique for real images obtained from CT scanning of a human head. The proposed method utilizes maximization of fuzzy entropy to determine the optimal thresholds. The optimization problem is solved by employing a very recently proposed population-based optimization technique, called biogeography based optimization (BBO) technique. In this work we have proposed some improvements over the basic BBO technique to implement nonlinear variation of immigration rate and emigration rate with number of species in a habitat. The proposed improved BBO based algorithm and the basic BBO algorithm are implemented for segmentation of fifteen real CT image slices. The results show that the proposed improved BBO variants could perform better than the basic BBO technique as well as genetic algorithm (GA) and particle swarm optimization (PSO) based segmentation of the same images using the principle of maximization of fuzzy entropy.     

基于混合迁移策略的生物地理学优化算法

为提高生物地理学优化算法(BBO)的性能,提出一种基于混合迁移策略的生物地理学优化算法(HMBBO)。该算法通过动态选取待迁出种群个体,平衡对解集搜索过程中的选择压力。采用混合迁移策略改进迁移机制,增强算法对解的搜索能力,避免引起过早收敛。并加入分段Logistic混沌机制对个体进行变异,提高算法的收敛精度。基于标准测试函数的仿真实验表明,HMBBO算法可有效避免早熟收敛,在收敛速度和收敛精度上较标准BBO算法有较大提高。     

生物地理信息优化算法中迁移算子的改进

原生物地理信息优化算法主要通过迁移算子与变异算子实现群体的进化, 常被应用于求解单目标优化问题。 如果将原有的进化算子直接用于求解连续多目标优化问题,会严重影响群体的多样性。文中将原迁移算子进行改进, 引入扰动因子, 增强群体的多样性。并以此为基础,提出基于生物地理信息的多目标进化算法(BBMOEA)。 通过与原有迁移算子下的算法比较及各类型测试函数的实验, 结果验证改进迁移算子对于求解多目标优化问题是有效可行的。同时将BBMOEA与经典算法SPEA2和NSGA-Ⅱ进行比较, 结果表明BBMOEA所得Pareto解集在收敛的同时,具有较均匀的分布性。