scholarly journals An improved Wolf pack algorithm for optimization problems: Design and evaluation

PLoS ONE ◽  
2021 ◽  
Vol 16 (8) ◽  
pp. e0254239
Author(s):  
Xuan Chen ◽  
Feng Cheng ◽  
Cong Liu ◽  
Long Cheng ◽  
Yin Mao
Keyword(s):  
Optimization Problems ◽  
Local Development ◽  
Initial Population ◽  
Local Optimum ◽  
Engineering Optimization ◽  
Test Functions ◽  
Opposition Based Learning ◽  
Global And Local ◽  
Swarm Intelligence Algorithm ◽  
Search Capability

Wolf Pack Algorithm (WPA) is a swarm intelligence algorithm that simulates the food searching process of wolves. It is widely used in various engineering optimization problems due to its global convergence and computational robustness. However, the algorithm has some weaknesses such as low convergence speed and easily falling into local optimum. To tackle the problems, we introduce an improved approach called OGL-WPA in this work, based on the employments of Opposition-based learning and Genetic algorithm with Levy’s flight. Specifically, in OGL-WPA, the population of wolves is initialized by opposition-based learning to maintain the diversity of the initial population during global search. Meanwhile, the leader wolf is selected by genetic algorithm to avoid falling into local optimum and the round-up behavior is optimized by Levy’s flight to coordinate the global exploration and local development capabilities. We present the detailed design of our algorithm and compare it with some other nature-inspired metaheuristic algorithms using various classical test functions. The experimental results show that the proposed algorithm has better global and local search capability, especially in the presence of multi-peak and high-dimensional functions.

scholarly journals Individual Disturbance and Attraction Repulsion Strategy Enhanced Seagull Optimization for Engineering Design

Mathematics ◽  
2022 ◽  
Vol 10 (2) ◽  
pp. 276
Author(s):  
Helong Yu ◽  
Shimeng Qiao ◽  
Ali Asghar Heidari ◽  
Chunguang Bi ◽  
Huiling Chen
Keyword(s):  
Optimization Algorithm ◽  
Optimization Problems ◽  
Solution Space ◽  
Search Process ◽  
Local Optimum ◽  
Engineering Optimization ◽  
New Variant ◽  
Practical Engineering ◽  
Poor Convergence ◽  
Swarm Intelligence Algorithm

The seagull optimization algorithm (SOA) is a novel swarm intelligence algorithm proposed in recent years. The algorithm has some defects in the search process. To overcome the problem of poor convergence accuracy and easy to fall into local optimality of seagull optimization algorithm, this paper proposed a new variant SOA based on individual disturbance (ID) and attraction-repulsion (AR) strategy, called IDARSOA, which employed ID to enhance the ability to jump out of local optimum and adopted AR to increase the diversity of population and make the exploration of solution space more efficient. The effectiveness of the IDARSOA has been verified using representative comprehensive benchmark functions and six practical engineering optimization problems. The experimental results show that the proposed IDARSOA has the advantages of better convergence accuracy and a strong optimization ability than the original SOA.

scholarly journals Chicken Swarm Optimization Based on Elite Opposition-Based Learning

2017 ◽  
Vol 2017 ◽  
pp. 1-20 ◽  
Author(s):  
Chiwen Qu ◽  
Shi’an Zhao ◽  
Yanming Fu ◽  
Wei He
Keyword(s):  
Optimization Problems ◽  
Local Development ◽  
Random Search ◽  
Standard Test ◽  
Population Diversity ◽  
Local Optimum ◽  
Basic Algorithm ◽  
Swarm Optimization ◽  
Opposition Based Learning ◽  
Chicken Swarm Optimization

Chicken swarm optimization is a new intelligent bionic algorithm, simulating the chicken swarm searching for food in nature. Basic algorithm is likely to fall into a local optimum and has a slow convergence rate. Aiming at these deficiencies, an improved chicken swarm optimization algorithm based on elite opposition-based learning is proposed. In cock swarm, random search based on adaptive t distribution is adopted to replace that based on Gaussian distribution so as to balance the global exploitation ability and local development ability of the algorithm. In hen swarm, elite opposition-based learning is introduced to promote the population diversity. Dimension-by-dimension greedy search mode is used to do local search for individual of optimal chicken swarm in order to improve optimization precision. According to the test results of 18 standard test functions and 2 engineering structure optimization problems, this algorithm has better effect on optimization precision and speed compared with basic chicken algorithm and other intelligent optimization algorithms.

scholarly journals A Hybrid Whale Optimization Algorithm for Global Optimization

Mathematics ◽  
2021 ◽  
Vol 9 (13) ◽  
pp. 1477
Author(s):  
Chun-Yao Lee ◽  
Guang-Lin Zhuo
Keyword(s):  
Global Optimization ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Whale Optimization Algorithm ◽  
Initial Population ◽  
Test Functions ◽  
Benchmark Test ◽  
Thermal Exchange ◽  
Whale Optimization ◽  
Benchmark Test Functions

This paper proposes a hybrid whale optimization algorithm (WOA) that is derived from the genetic and thermal exchange optimization-based whale optimization algorithm (GWOA-TEO) to enhance global optimization capability. First, the high-quality initial population is generated to improve the performance of GWOA-TEO. Then, thermal exchange optimization (TEO) is applied to improve exploitation performance. Next, a memory is considered that can store historical best-so-far solutions, achieving higher performance without adding additional computational costs. Finally, a crossover operator based on the memory and a position update mechanism of the leading solution based on the memory are proposed to improve the exploration performance. The GWOA-TEO algorithm is then compared with five state-of-the-art optimization algorithms on CEC 2017 benchmark test functions and 8 UCI repository datasets. The statistical results of the CEC 2017 benchmark test functions show that the GWOA-TEO algorithm has good accuracy for global optimization. The classification results of 8 UCI repository datasets also show that the GWOA-TEO algorithm has competitive results with regard to comparison algorithms in recognition rate. Thus, the proposed algorithm is proven to execute excellent performance in solving optimization problems.

scholarly journals Improved Salp Swarm Algorithm with Simulated Annealing for Solving Engineering Optimization Problems

Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 1092
Author(s):  
Qing Duan ◽  
Lu Wang ◽  
Hongwei Kang ◽  
Yong Shen ◽  
Xingping Sun ◽  
...  
Keyword(s):  
Simulated Annealing ◽  
Optimization Problems ◽  
Chaotic Sequence ◽  
Engineering Optimization ◽  
Exploration And Exploitation ◽  
Salp Swarm Algorithm ◽  
Symmetric Perturbation ◽  
Swarm Algorithm ◽  
Search Capability ◽  
Engineering Optimization Problems

Swarm-based algorithm can successfully avoid the local optimal constraints, thus achieving a smooth balance between exploration and exploitation. Salp swarm algorithm(SSA), as a swarm-based algorithm on account of the predation behavior of the salp, can solve complex daily life optimization problems in nature. SSA also has the problems of local stagnation and slow convergence rate. This paper introduces an improved salp swarm algorithm, which improve the SSA by using the chaotic sequence initialization strategy and symmetric adaptive population division. Moreover, a simulated annealing mechanism based on symmetric perturbation is introduced to enhance the local jumping ability of the algorithm. The improved algorithm is referred to SASSA. The CEC standard benchmark functions are used to evaluate the efficiency of the SASSA and the results demonstrate that the SASSA has better global search capability. SASSA is also applied to solve engineering optimization problems. The experimental results demonstrate that the exploratory and exploitative proclivities of the proposed algorithm and its convergence patterns are vividly improved.

scholarly journals A Novel Hybrid Algorithm Based on Grey Wolf Optimizer and Fireworks Algorithm

Sensors ◽  
2020 ◽  
Vol 20 (7) ◽  
pp. 2147 ◽  
Author(s):  
Zhihang Yue ◽  
Sen Zhang ◽  
Wendong Xiao
Keyword(s):  
Hybrid Algorithm ◽  
Optimization Problems ◽  
Optimization Method ◽  
Grey Wolf Optimizer ◽  
Local Optimum ◽  
Grey Wolf ◽  
Optimal Search ◽  
Fireworks Algorithm ◽  
Wide Range ◽  
Search Capability

Grey wolf optimizer (GWO) is a meta-heuristic algorithm inspired by the hierarchy of grey wolves (Canis lupus). Fireworks algorithm (FWA) is a nature-inspired optimization method mimicking the explosion process of fireworks for optimization problems. Both of them have a strong optimal search capability. However, in some cases, GWO converges to the local optimum and FWA converges slowly. In this paper, a new hybrid algorithm (named as FWGWO) is proposed, which fuses the advantages of these two algorithms to achieve global optima effectively. The proposed algorithm combines the exploration ability of the fireworks algorithm with the exploitation ability of the grey wolf optimizer (GWO) by setting a balance coefficient. In order to test the competence of the proposed hybrid FWGWO, 16 well-known benchmark functions having a wide range of dimensions and varied complexities are used in this paper. The results of the proposed FWGWO are compared to nine other algorithms, including the standard FWA, the native GWO, enhanced grey wolf optimizer (EGWO), and augmented grey wolf optimizer (AGWO). The experimental results show that the FWGWO effectively improves the global optimal search capability and convergence speed of the GWO and FWA.

scholarly journals Adaptive Operator Quantum-Behaved Pigeon-Inspired Optimization Algorithm with Application to UAV Path Planning

Algorithms ◽  
2018 ◽  
Vol 12 (1) ◽  
pp. 3 ◽  
Author(s):  
Chunhe Hu ◽  
Yu Xia ◽  
Junguo Zhang
Keyword(s):  
Path Planning ◽  
Nonlinear Problems ◽  
Mapping Method ◽  
Initial Population ◽  
Local Optimum ◽  
Planning Problem ◽  
Dynamic Constraints ◽  
Logistic Mapping ◽  
Global And Local ◽  
Better Than

Path planning of unmanned aerial vehicles (UAVs) in threatening and adversarial areas is a constrained nonlinear optimal problem which takes a great amount of static and dynamic constraints into account. Quantum-behaved pigeon-inspired optimization (QPIO) has been widely applied to such nonlinear problems. However, conventional QPIO is suffering low global convergence speed and local optimum. In order to solve the above problems, an improved QPIO algorithm, adaptive operator QPIO, is proposed in this paper. Firstly, a new initialization process based on logistic mapping method is introduced to generate the initial population of the pigeon-swarm. After that, to improve the performance of the map and compass operation, the factor parameter will be adaptively updated in each iteration, which can balance the ability between global and local search. In the final landmark operation, the gradual decreasing pigeon population-updating strategy is introduced to prevent premature convergence and local optimum. Finally, the demonstration of the proposed algorithm on UAV path planning problem is presented, and the comparison result indicates that the performance of our algorithm is better than that of particle swarm optimization (PSO), pigeon-inspired optimization (PIO), and its variants, in terms of convergence and accuracy.

scholarly journals Novel Swarm Intelligence Algorithm for Global Optimization and Multi-UAVs Cooperative Path Planning: Anas Platyrhynchos Optimizer

2020 ◽  
Vol 10 (14) ◽  
pp. 4821
Author(s):  
Yong Zhang ◽  
Pengfei Wang ◽  
Liuqing Yang ◽  
Yanbin Liu ◽  
Yuping Lu ◽  
...  
Keyword(s):  
Path Planning ◽  
Swarm Intelligence ◽  
Optimization Problems ◽  
Local Development ◽  
Anas Platyrhynchos ◽  
Intelligent Algorithm ◽  
Intelligence Algorithm ◽  
Engineering Problems ◽  
The Mathematical Model ◽  
Swarm Intelligence Algorithm

In this study, a novel type of swarm intelligence algorithm referred as the anas platyrhynchos optimizer is proposed by simulating the cluster action of the anas platyrhynchos. Starting from the core of swarm intelligence algorithm, on the premise of the use of few parameters and ease in implementation, the mathematical model and algorithm flow of the anas platyrhynchos optimizer are given, and the balance between global search and local development in the algorithm is ensured. The algorithm was applied to a benchmark function and a cooperative path planning solution for multi-UAVs as a means of testing the performance of the algorithm. The optimization results showed that the anas platyrhynchos optimizer is more superior in solving optimization problems compared with the mainstream intelligent algorithm. This study provides a new idea for solving more engineering problems.

scholarly journals A Tent Marine Predators Algorithm with Estimation Distribution Algorithm and Gaussian Random Walk for Continuous Optimization Problems

2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Chang-Jian Sun ◽  
Fang Gao
Keyword(s):  
Random Walk ◽  
Population Distribution ◽  
Optimization Problems ◽  
Continuous Optimization ◽  
Population Diversity ◽  
Initial Population ◽  
Local Optimum ◽  
Marine Predators ◽  
Gaussian Random Walk ◽  
Estimation Distribution Algorithm

The marine predators algorithm (MPA) is a novel population-based optimization method that has been widely used in real-world optimization applications. However, MPA can easily fall into a local optimum because of the lack of population diversity in the late stage of optimization. To overcome this shortcoming, this paper proposes an MPA variant with a hybrid estimation distribution algorithm (EDA) and a Gaussian random walk strategy, namely, HEGMPA. The initial population is constructed using cubic mapping to enhance the diversity of individuals in the population. Then, EDA is adapted into MPA to modify the evolutionary direction using the population distribution information, thus improving the convergence performance of the algorithm. In addition, a Gaussian random walk strategy with medium solution is used to help the algorithm get rid of stagnation. The proposed algorithm is verified by simulation using the CEC2014 test suite. Simulation results show that the performance of HEGMPA is more competitive than other comparative algorithms, with significant improvements in terms of convergence accuracy and convergence speed.

Engineering Design Optimization Using an Advanced Hybrid Algorithm

2022 ◽  
Vol 13 (1) ◽  
pp. 0-0
Keyword(s):  
Design Optimization ◽  
Engineering Design ◽  
Hybrid Algorithm ◽  
Optimization Problems ◽  
Novel Mutation ◽  
Solution Space ◽  
Selection Strategy ◽  
Engineering Design Optimization ◽  
Global And Local ◽  
Search Capability

An advanced hybrid algorithm (haDEPSO) proposed in this paper for engineering design optimization problems. It integrated with suggested advanced differential evolution (aDE) and particle swarm optimization (aPSO). In aDE introduced a novel mutation, crossover and selection strategy, to avoiding premature convergence. And aPSO consists of novel gradually varying parameters, to escape stagnation. So, convergence characteristic of aDE and aPSO provides different approximation to the solution space. Thus, haDEPSO achieve better solutions due to integrating merits of aDE and aPSO. Also, in haDEPSO individual population is merged with other in a pre-defined manner, to balance between global and local search capability. Proposed hybrid haDEPSO as well as its integrating component aDE and aPSO has been applied to five engineering design optimization problems. Numerical, statistical and graphical experiments (best, worst, mean and standard deviation plus convergence analysis) confirm the superiority of the proposed algorithms over many state-of-the-art algorithms.

scholarly journals A Hybrid Lightning Search Algorithm-Simplex Method for Global Optimization

2017 ◽  
Vol 2017 ◽  
pp. 1-23 ◽  
Author(s):  
Yuting Lu ◽  
Yongquan Zhou ◽  
Xiuli Wu
Keyword(s):  
Engineering Design ◽  
Simplex Method ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Function Optimization ◽  
Local Optimum ◽  
Computational Accuracy ◽  
Design Problems ◽  
Opposition Based Learning ◽  
Engineering Design Problems

In this paper, a novel hybrid lightning search algorithm-simplex method (LSA-SM) is proposed to solve the shortcomings of lightning search algorithm (LSA) premature convergence and low computational accuracy and it is applied to function optimization and constrained engineering design optimization problems. The improvement adds two major optimization strategies. Simplex method (SM) iteratively optimizes the current worst step leaders to avoid the population searching at the edge, thus improving the convergence accuracy and rate of the algorithm. Elite opposition-based learning (EOBL) increases the diversity of population to avoid the algorithm falling into local optimum. LSA-SM is tested by 18 benchmark functions and five constrained engineering design problems. The results show that LSA-SM has higher computational accuracy, faster convergence rate, and stronger stability than other algorithms and can effectively solve the problem of constrained nonlinear optimization in reality.

Sign in / Sign up

Export Citation Format

Share Document