PSO和ABC的混合优化算法

通过将粒子群优化(Particle Swarm Optimization,PSO)算法与人工蜂群(Artificial Bee Colony,ABC)算法相结合,提出一种ABC-PSO并行混合优化算法。在每次迭代中,将种群分为两个子种群,一个子种群使用PSO算法,另一个子种群使用ABC算法,两个算法寻优后进行比较,选出最优适应值。通过混合算法对4个标准函数进行测试,并与标准PSO算法进行比较,结果表明混合算法具有更好的优化性能。     

An automated approach for the design of Mechanically Stabilized Earth Walls incorporating metaheuristic optimization algorithms

Considered as cost-efficient, reliable and aesthetic alternatives to the conventional retaining structures, Mechanically Stabilized Earth Walls (MSEWs) have been increasingly used in civil engineering practice over the previous decades. The design of these structures is conventionally based on engineering guidelines, requiring the use of trial and error approaches to determine the design variables. Therefore, the quality and cost effectiveness of the design is limited with the effort, intuition, and experience of the engineer while the process transpires to be time-consuming, both of which can be solved by developing automated approaches. In order to address these issues, the present study introduces a novel framework to optimize the (i) reinforcement type, (ii) length, and (iii) layout of MSEWs for minimum cost, integrating metaheuristic optimization algorithms in compliance with the Federal Highway Administration guidelines. The framework is conjoined with optimization algorithms such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Artificial Bee Colony (ABC), and Differential Evolution (DE) and tested with a set of benchmark design problems that incorporate various types of MSEWs with different heights. The results are comparatively evaluated to assess the most effective optimization algorithm and validated using a well-known MSEW analysis and design software. The outcomes indicate that the proposed framework, implemented with a powerful optimization algorithm, can effectively produce the optimum design in a matter of seconds. In this sense, DE algorithm is proposed based on the improved results over GA, PSO, and ABC.     

病毒进化理论人工蜂群算法研究

为了提高人工蜂群算法的搜索性能,引入了连续状态下的生物病毒机制和宿主与病毒基于感染操作等思想优化人工蜂群算法搜索机制。人工蜂群算法具有控制参数少、实现简单的优点,但是由于蜂群收敛采用局部搜索,使得算法易于早熟收敛或者陷入局部最优值。通过病毒进化对人工蜂群算法进化机制的分析,利用病毒的感染与进化,建立精英雇佣蜂对懒惰蜂引导,提高人工蜂群算法的搜索性能,加强群体的多样性,提高了局部搜索能力。仿真实验表明这种方法较常见的人工蜂群算法,有较明显收敛速度和搜索精度改进。     

Quantum behaved Particle Swarm Optimization (QPSO) for multi-objective design optimization of composite structures

We present a new, generic method/model for multi-objective design optimization of laminated composite components using a novel multi-objective optimization algorithm developed on the basis of the Quantum behaved Particle Swarm Optimization (QPSO) paradigm. QPSO is a co-variant of the popular Particle Swarm Optimization (PSO) and has been developed and implemented successfully for the multi-objective design optimization of composites. The problem is formulated with multiple objectives of minimizing weight and the total cost of the composite component to achieve a specified strength. The primary optimization variables are – the number of layers, its stacking sequence (the orientation of the layers) and thickness of each layer. The classical lamination theory is utilized to determine the stresses in the component and the design is evaluated based on three failure criteria; Failure Mechanism based Failure criteria, Maximum stress failure criteria and the Tsai–Wu Failure criteria. The optimization method is validated for a number of different loading configurations – uniaxial, biaxial and bending loads. The design optimization has been carried for both variable stacking sequences as well as fixed standard stacking schemes and a comparative study of the different design configurations evolved has been presented. Also, the performance of QPSO is compared with the conventional PSO.     

The Bisection–Artificial Bee Colony algorithm to solve Fixed point problems

In this paper, we introduce a novel iterative method to finding the fixed point of a nonlinear function. Therefore, we combine ideas proposed in Artificial Bee Colony algorithm (Karaboga and Basturk, 2007) and Bisection method (Burden and Douglas, 1985). This method is new and very efficient for solving a non-linear equation. We illustrate this method with four benchmark functions and compare results with others methods, such as ABC, PSO, GA and Firefly algorithms.     

双搜索人工蜂群算法的彩色图像多阈值分割

针对彩色图像多阈值分割中普遍存在精度低、速度慢的问题,提出了一种新的基于双搜索人工蜂群（DABC）的彩色图像多阈值分割算法。首先由于人工蜂群算法单一的解搜索公式存在不足,对雇佣蜂和跟随蜂各提出了一种搜索公式,进而对人工蜂群算法的相关参数进行了改进,然后做了DABC算法、全局最优引导人工蜂群算法（GABC）、人工蜂群算法（ABC）、粒子群优化算法（PSO）这四种算法的彩色图像多阈值分割对比实验。实验结果表明,与其他三种算法相比,基于DABC的彩色图像多阈值分割方法在分割的精度和速度上都有明显提高,完全能满足实际的需要。     

An approximation algorithm for fuzzy polynomial interpolation with Artificial Bee Colony algorithm

In this paper, a novel approximation algorithm for fuzzy polynomial interpolation using Artificial Bee Colony algorithm to interpolate fuzzy data is discussed. However, we use our modified ABC (MABC; Mansouri et al. [13]) to perform the required task. Some examples (including the benchmark functions Griewank and Rastrigin) illustrate the rationality of the method and the validity of the solution. We compare our results with other methods including Genetic Algorithm (GA), Particle Swarm Algorithm (PSO). The results show that proposed method outperforms the other algorithms.     

基于混沌局部搜索算子的人工蜂群算法

在求解函数优化问题时,为了提升人工蜂群算法局部搜索能力,提出了一种新颖的混沌蜂群算法。新算法设计了一种混沌局部搜索算子,并将其嵌入蜂群算法框架中;该算子不仅能够实现在最优食物源周围局部搜索,还能够随着进化代数增加使搜索范围不断缩小。仿真实验结果表明,与人工蜂群算法相比,新算法在Rosenbrock函数上,求解精度和收敛速度明显占优;此外新算法在多模函数Griewank和Rastrigin上,收敛速度明显占优。     

Performance investigation of ABC algorithm in multi-area power system with multiple interconnected generators

This paper presents an extensive study on the application of Artificial Bee Colony (ABC) algorithm for load frequency control (LFC) in multi-area power system with multiple interconnected generators. The LFC model incorporates various possible physical constraints and non-linearities such as generation rate constraint, time delay, dead zone and boiler. The ABC algorithm is used to find the optimum PID controller parameters. The tuning performance of the algorithm is comparatively investigated against different optimization technique such as evolutionary programming (EP), genetic algorithm (GA), gravitational search algorithm (GSA) and particle swarm optimization (PSO). The robustness analysis of the system is also evaluated by investigating the dynamic response of the controller with load demand at varying time step, tuning based on different performance criterion and by varying the load demand. The performance of the system is evaluated based on the settling time and maximum overshoot value of the frequency deviation response. The performance of ABC is also verified against an exhaustive search based on interval halving method. Despite employing a single controller for multiple interconnected generators, the optimized controller is able to successfully damp oscillations in the system response and regulate the area control error back to zero in minimal amount of time. The results indicate the superiority of the ABC algorithm’s search mechanism in finding the optimum set of PID controller’s gain.     

人工蜂群算法在重力坝断面优化设计中的应用

人工蜂群算法是一种新型的群智能优化算法,对于处理复杂的非线性多峰值优化问题具有很好的适用性。对三种典型测试函数进行性能测试,与粒子群优化算法相比较,人工蜂群算法的适应度函数评价次数明显较少,对求解多峰值优化问题具有较好的适应性,将人工蜂群算法应用于重力坝断面优化设计,研究结果表明,该方法是可行的,具有寻优效率高且易于实现的优点。     

Artificial bee colony algorithm for large-scale problems and engineering design optimization

Engineering design problems are generally large scale or nonlinear or constrained optimization problems. The Artificial Bee Colony (ABC) algorithm is a successful tool for optimizing unconstrained problems. In this work, the ABC algorithm is used to solve large scale optimization problems, and it is applied to engineering design problems by extending the basic ABC algorithm simply by adding a constraint handling technique into the selection step of the ABC algorithm in order to prefer the feasible regions of entire search space. Nine well-known large scale unconstrained test problems and five well-known constrained engineering problems are solved by using the ABC algorithm and the performance of ABC algorithm is compared against those of state-of-the-art algorithms.     

A powerful hybrid clustering method based on modified stem cells and Fuzzy C-means algorithms

One of the simple techniques for Data Clustering is based on Fuzzy C-means (FCM) clustering which describes the belongingness of each data to a cluster by a fuzzy membership function instead of a crisp value. However, the results of fuzzy clustering depend highly on the initial state selection and there is also a high risk for getting the best results when the datasets are large. In this paper, we present a hybrid algorithm based on FCM and modified stem cells algorithms, we called it SC-FCM algorithm, for optimum clustering of a dataset into K clusters. The experimental results obtained by using the new algorithm on different well-known datasets compared with those obtained by K-means algorithm, FCM, Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), Artificial Bee Colony (ABC) Algorithm demonstrate the better performance of the new algorithm.     

多交互式人工蜂群算法及其收敛性分析

针对人工蜂群（ABC）算法不易跳出局部最优解的缺点,提出了多交互式人工蜂群（MIABC）算法。该算法在基本人工蜂群算法的基础上引入随机邻域搜索策略,结合跨维搜索策略,且改进蜜蜂越限处理方式,使得算法搜索方式多样化,从而使得算法搜索更具跳跃性,不易陷入局部最优解,同时,对其进行收敛性分析和性能测试。在五种经典基准测试函数和时间复杂度实验上的仿真结果表明,相对于标准人工蜂群算法和基本粒子群优化（PSO）算法,该算法在1E-2精度下收敛速度提高了约30%和65%,搜索精度更优,且在高维求解问题方面有明显优势。     

Energy Efficient Cluster Head Selection for Internet of Things

Recently, Internet of Things (IoT) devices are highly utilized in diverse fields such as environmental monitoring, industries, and smart home, among others. Under such instances, a cluster head is selected among the diverse IoT devices of wireless sensor network (WSN) based IoT network to maintain a reliable network with efficient data transmission. This article proposed a novel method with the combination of Gravitational Search Algorithm (GSA) and Artificial Bee Colony (ABC) algorithm to accomplish the efficient cluster head selection. This method considers the distance, energy, delay, load, and temperature of the IoT devices during the operation of the cluster head selection process. Furthermore, the performance of the proposed method is analyzed by comparing with conventional methods such as Artificial Bee Colony (ABC), Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and GSO algorithms. The analysis related to the existence of the number of alive nodes, convergence estimation, and performance in terms of normalized energy, load, and temperature of the IoT devices are determined. Thus the analysis of our implementation reveals the superior performance of the proposed method.     

Fractional order fuzzy-PID control of a combined cycle power plant using Particle Swarm Optimization algorithm with an improved dynamic parameters selection

The effectiveness of the Particle Swarm Optimization (PSO) algorithm in solving any optimization problem is highly dependent on the right selection of tuning parameters. A better control parameter improves the flexibility and robustness of the algorithm. In this paper, a new PSO algorithm based on dynamic control parameters selection is presented in order to further enhance the algorithm's rate of convergence and the minimization of the fitness function. The powerful Dynamic PSO (DPSO) uses a new mechanism to dynamically select the best performing combinations of acceleration coefficients, inertia weight, and population size. A fractional order fuzzy-PID (fuzzy-FOPID) controller based on the DPSO algorithm is proposed to perform the optimization task of the controller gains and improve the performance of a single-shaft Combined Cycle Power Plant (CCPP). The proposed controller is used in speed control loop to improve the response during frequency drop or change in loading. The performance of the fuzzy-FOPID based DPSO is compared with those of the conventional PSO, Comprehensive Learning PSO (CLPSO), Heterogeneous CLPSO (HCLPSO), Genetic Algorithm (GA), Differential Evolution (DE), and Artificial Bee Colony (ABC) algorithm. The simulation results show the effectiveness and performance of the proposed method for frequency drop or change in loading.     

基于knee points的改进多目标人工蜂群算法

传统的人工蜂群算法（Artificial Bee Colony algorithm,ABC）及其在多目标上的扩展（Multi Objective Artificial Bee Colony algorithm,MOABC）存在着在高维、多峰函数情况下收敛速度变慢、后期容易陷入局部最优以及寻优精度丢失等问题。基于knee points提高收敛性和分布性的特点,设计了一种快速识别knee point的算法并将其应用到多目标人工蜂群算法中,提出了一种基于knee points的改进多目标人工蜂群算法（KnMOABC）。算法在迭代过程中考虑pareto支配关系的同时,优先选择knee point作为下一代个体,极大地增强了算法的收敛速度,同时,在knee point识别算法中加入自适应的策略以保持良好的分布性。实验结果表明,KnMOABC的性能优于三个最新的多目标人工蜂群对比算法。     

量子位Bloch坐标的量子人工蜂群优化算法

为了改善人工蜂群(ABC)算法在解决多变量优化问题时存在的收敛速度较慢、容易陷入局部最优的不足,结合量子理论和人工蜂群算法提出一种新的量子优化算法。算法首先采用量子位Bloch坐标对蜂群算法中食物源进行编码,扩展了全局最优解的数量,提高了蜂群算法获得全局最优解的概率;然后用量子旋转门实现搜索过程中的食物源更新。对于量子旋转门的转角关系的确定,提出了一种新的方法。从理论上证明了蜂群算法在Bloch球面每次以等面积搜索时,量子旋转门的两个旋转相位大小近似于反比例关系,避免了固定相位旋转的不均等性,使得搜索呈现规律性。在典型函数优化问题的实验中,所提算法在搜索能力和优化效率两个方面优于普通量子人工蜂群(QABC)算法和单一人工蜂群算法。     

Artificial algae algorithm (AAA) for nonlinear global optimization

In this study, a novel bio-inspired metaheuristic optimization algorithm called artificial algae algorithm (AAA) inspired by the living behaviors of microalgae, photosynthetic species, is introduced. The algorithm is based on evolutionary process, adaptation process and the movement of microalgae. The performance of the algorithm has been verified on various benchmark functions and a real-world design optimization problem. The CEC’05 function set was employed as benchmark functions and the test results were compared with the algorithms of Artificial Bee Colony (ABC), Bee Algorithm (BA), Differential Evolution (DE), Ant Colony Optimization for continuous domain (ACO_R) and Harmony Search (HS_POP). The pressure vessel design optimization problem, which is one of the widely used optimization problems, was used as a sample real-world design optimization problem to test the algorithm. In order to compare the results on the mentioned problem, the methods including ABC and Standard PSO (SPSO2011) were used. Mean, best, standard deviation values and convergence curves were employed for the analyses of performance. Furthermore, mean square error (MSE), root mean square error (RMSE) and mean absolute percentage error (MAPE), which are computed as a result of using the errors of algorithms on functions, were used for the general performance comparison. AAA produced successful and balanced results over different dimensions of the benchmark functions. It is a consistent algorithm having balanced search qualifications. Because of the contribution of adaptation and evolutionary process, semi-random selection employed while choosing the source of light in order to avoid local minima, and balancing of helical movement methods each other. Moreover, in tested real-world application AAA produced consistent results and it is a stable algorithm.     

改进膜蜂群算法求解0-1背包问题

针对现有算法在求解大规模0-1背包问题时存在的不足,提出一种改进膜蜂群算法(IABCPS)。IABCPS将膜计算(MC)的思想引入人工蜂群(ABC)算法,基于极坐标编码的方式,采用细胞型单层膜结构(OLMS),利用各基本膜中改进人工蜂群算子进行迭代,并结合表层膜实现数据交流;算法通过调整内部参数,实现寻优过程中开发和探索的有效配合。实验结果表明IABCPS在求解小规模背包问题时能准确找到最优解。在求解200个物品的背包问题时,IABCPS相对克隆选择免疫遗传算法(CSIGA)平均结果提高了0.15%,方差降低了97.53%;相对于ABC算法平均结果提高了4.15%,方差降低了99.69%,表现出了良好的寻优能力和稳定性。在与ABCPS求解物品数量为300,500,700,1000的大规模背包问题的比较实验中,IABCPS的平均结果比ABCPS分别高1.25%、3.93%、6.75%和11.21%,且方差与实验次数的商始终维持在个位数,表现出了良好的鲁棒性。