An improved sparrow search algorithm based on levy flight and opposition-based learning

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Danni Chen ◽  
JianDong Zhao ◽  
Peng Huang ◽  
Xiongna Deng ◽  
Tingting Lu
Keyword(s):  
Parameter Optimization ◽  
Optimization Problem ◽  
Heuristic Algorithms ◽  
Search Algorithm ◽  
Convergence Speed ◽  
Support Vector ◽  
Lévy Flight ◽  
Levy Flight ◽  
Content Type ◽  
Opposition Based Learning

Purpose Sparrow search algorithm (SSA) is a novel global optimization method, but it is easy to fall into local optimization, which leads to its poor search accuracy and stability. The purpose of this study is to propose an improved SSA algorithm, called levy flight and opposition-based learning (LOSSA), based on LOSSA strategy. The LOSSA shows better search accuracy, faster convergence speed and stronger stability. Design/methodology/approach To further enhance the optimization performance of the algorithm, The Levy flight operation is introduced into the producers search process of the original SSA to enhance the ability of the algorithm to jump out of the local optimum. The opposition-based learning strategy generates better solutions for SSA, which is beneficial to accelerate the convergence speed of the algorithm. On the one hand, the performance of the LOSSA is evaluated by a set of numerical experiments based on classical benchmark functions. On the other hand, the hyper-parameter optimization problem of the Support Vector Machine (SVM) is also used to test the ability of LOSSA to solve practical problems. Findings First of all, the effectiveness of the two improved methods is verified by Wilcoxon signed rank test. Second, the statistical results of the numerical experiment show the significant improvement of the LOSSA compared with the original algorithm and other natural heuristic algorithms. Finally, the feasibility and effectiveness of the LOSSA in solving the hyper-parameter optimization problem of machine learning algorithms are demonstrated. Originality/value An improved SSA based on LOSSA is proposed in this paper. The experimental results show that the overall performance of the LOSSA is satisfactory. Compared with the SSA and other natural heuristic algorithms, the LOSSA shows better search accuracy, faster convergence speed and stronger stability. Moreover, the LOSSA also showed great optimization performance in the hyper-parameter optimization of the SVM model.

Design and application of an optimally tuned PID controller for DC motor speed regulation via a novel hybrid Lévy flight distribution and Nelder–Mead algorithm

2021 ◽  
pp. 014233122110196
Author(s):  
Davut Izci
Keyword(s):  
Pid Controller ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Absolute Error ◽  
Dc Motor ◽  
Cuckoo Search Algorithm ◽  
Lévy Flight ◽  
Motor Speed ◽  
Levy Flight ◽  
Speed Regulation

This paper deals with the design of an optimally performed proportional–integral–derivative (PID) controller utilized for speed control of a direct current (DC) motor. To do so, a novel hybrid algorithm was proposed which employs a recent metaheuristic approach, named Lévy flight distribution (LFD) algorithm, and a simplex search method known as Nelder–Mead (NM) algorithm. The proposed algorithm (LFDNM) combines both LFD and NM algorithms in such a way that the good explorative behaviour of LFD and excellent local search capability of NM help to form a novel hybridized version that is well balanced in terms of exploration and exploitation. The promise of the proposed structure was observed through employment of a DC motor with PID controller. Optimum values for PID gains were obtained with the aid of an integral of time multiplied absolute error objective function. To verify the effectiveness of the proposed algorithm, comparative simulations were carried out using cuckoo search algorithm, genetic algorithm and original LFD algorithm. The system behaviour was assessed through analysing the results for statistical and non-parametric tests, transient and frequency responses, robustness, load disturbance, energy and maximum control signals. The respective evaluations showed better performance of the proposed approach. In addition, the better performance of the proposed approach was also demonstrated through experimental verification. Further evaluation to demonstrate better capability was performed by comparing the LFDNM-based PID controller with other state-of-the-art algorithms-based PID controllers with the same system parameters, which have also confirmed the superiority of the proposed approach.

scholarly journals A gravitational search algorithm based on levy flight

2021 ◽  
Vol 1865 (4) ◽  
pp. 042006
Author(s):  
Jing Zhao ◽  
Haidong Zhu ◽  
Yinhua Hu ◽  
Enjun Hu ◽  
Baole Huang ◽  
...  
Keyword(s):  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Lévy Flight ◽  
Levy Flight ◽  
Gravitational Search

scholarly journals Active Disturbance Rejection Control Design Using the Optimization Algorithm for a Hydraulic Quadruped Robot

2021 ◽  
Vol 2021 ◽  
pp. 1-22
Author(s):  
Yuqi Fan ◽  
Junpeng Shao ◽  
Guitao Sun ◽  
Xuan Shao
Keyword(s):  
Disturbance Rejection ◽  
Search Algorithm ◽  
Parameter Tuning ◽  
Quadruped Robot ◽  
Search Problem ◽  
Lévy Flight ◽  
Control Performance ◽  
External Interference ◽  
Levy Flight ◽  
Active Disturbance Rejection

To increase the robustness and control precision of a hydraulic quadruped robot and simultaneously enhance the dynamic and steady characteristic of the hydraulic system, an active disturbance rejection controller (ADRC) tuned using the Lévy-flight beetle antennae search algorithm (LBAS) was proposed. Moreover, the designed controller was used in the hydraulic quadruped robot to enhance the control performance and restrain the disturbances. The use of the Lévy-flight trajectory in the advanced algorithm can help increase the search speed and iteration accuracy. In the LBAS-ADRC, the parameter tuning method is adopted to develop the active disturbance rejection controller enhanced using the beetle antennae search algorithm. When implemented in the hydraulic quadruped robot, the LBAS-ADRC can ensure satisfactory dynamic characteristics and stability in the presence of external interference. In particular, in the proposed method, the ADRC parameter search problem is transformed to a sixteen-dimensional search problem, the solution of which is identified using the Lévy-flight beetle antennae search algorithm. Moreover, three different algorithms are implemented in the active disturbance rejection controller tuning problem to demonstrate the control performance of the proposed controller. The analysis results show that the proposed controller can achieve a small amplitude overshoot under complex and changeable environments.

A Modified Binary Crow Search Algorithm for Solving the Graph Coloring Problem

2020 ◽  
Vol 11 (2) ◽  
pp. 28-46 ◽  
Author(s):  
Yassine Meraihi ◽  
Mohammed Mahseur ◽  
Dalila Acheli
Keyword(s):  
Graph Coloring ◽  
Optimization Problem ◽  
Heuristic Algorithms ◽  
Search Algorithm ◽  
Distribution Method ◽  
Local Optima ◽  
Coloring Problem ◽  
Graph Coloring Problem ◽  
Np Hard Problem ◽  
The Right

The graph coloring problem (GCP) is a well-known classical combinatorial optimization problem in graph theory. It is known to be an NP-Hard problem, so many heuristic algorithms have been employed to solve this problem. This article proposes a modified binary crow search algorithm (MBCSA) to solve the graph coloring problem. First, the binary crow search algorithm is obtained from the original crow search algorithm using the V-shaped transfer function and the discretization method. Second, we use chaotic maps to choose the right values of the flight length (FL) and the awareness probability (AP). Third, we adopt the Gaussian distribution method to replace the random variables used for updating the position of the crows. The aim of these contributions is to avoid the premature convergence to local optima and ensure the diversity of the solutions. To evaluate the performance of our algorithm, we use the well-known DIMACS benchmark graph coloring instances. The simulation results reveal the efficiency of our proposed algorithm in comparison with other existing algorithms in the literature.

Two Meta-Heuristics for Solving Unconstrained Optimization Problems and Machinery Problems

2014 ◽  
Vol 1044-1045 ◽  
pp. 1418-1423
Author(s):  
Pasura Aungkulanon
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problem ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Harmony Search ◽  
Particle Swarm ◽  
Finite Sequence ◽  
Swarm Optimization ◽  
Machining Optimization

Machining optimization problem aims to optimize machinery conditions which are important for economic settings. The effective methods for solving these problems using a finite sequence of instructions can be categorized into two groups; exact optimization algorithm and meta-heuristic algorithms. A well-known meta-heuristic approach called Harmony Search Algorithm was used to compare with Particle Swarm Optimization. We implemented and analysed algorithms using unconstrained problems under different conditions included single, multi-peak, curved ridge optimization, and machinery optimization problem. The computational outputs demonstrated the proposed Particle Swarm Optimization resulted in the better outcomes in term of mean and variance of process yields.

Thermal morphing anisogrid smart space structures part 2: Ranking of geometric parameter importance, trust region optimization, and performance evaluation

2017 ◽  
Vol 24 (13) ◽  
pp. 2873-2893 ◽  
Author(s):  
Austin A Phoenix ◽  
Jeff Borggaard ◽  
Pablo A Tarazaga
Keyword(s):  
Parameter Optimization ◽  
Optimization Problem ◽  
Optimal Allocation ◽  
Search Algorithm ◽  
Thermal Strain ◽  
Computational Cost ◽  
Trust Region ◽  
Minimum Cost ◽  
Space Mission ◽  
Model Parameters

As future space mission structures are required to achieve more with scarcer resources, new structural configurations and modeling capabilities will be needed to meet the next generation space structural challenges. A paradigm shift is required away from the current structures that are static, heavy, and stiff, to innovative lightweight structures that meet requirements by intelligently adapting to the environment. As the complexity of these intelligent structures increases, the computational cost of the modeling and optimization efforts become increasingly demanding. Novel methods that identify and reduce the number of parameters to only those most critical considerably reduce these complex problems, allowing highly iterative evaluations and in-depth optimization efforts to be computationally feasible. This parameter ranking methodology will be demonstrated on the optimization of the thermal morphing anisogrid boom. The proposed novel morphing structure provides high precision morphing through the use of thermal strain as the sole actuation mechanism. The morphing concept uses the helical members in the anisogrid structure to provide complex constrained actuations that can achieve the six degree of freedom morphing capability. This structure provides a unique potential to develop an integrated structural morphing system, where the adaptive morphing capability is integrated directly into the primary structure. To identify parameters of interest, the Q-DEIM model reduction algorithm is implemented to rank the model parameters based on their impact on the morphing performance. This parameter ranking method provides insight into the system and enables the optimal allocation of computational and engineering resources to the most critical areas of the system for optimization. The methodology, in conjunction with a singular value decomposition (SVD), provides a ranking and identifies parameters of relative importance. The SVD is used to truncate the nine parameters problem at two locations, generating a five parameter optimization problem and a three parameter optimization problem. To evaluate the ranking, a parameter sweep in conjunction with a simple minimum cost function search algorithm will compare all 120 five parameter ranking orders to the Q-DEIM ranking. This reduced parameter set significantly reduces the parameter complexity and the computational cost of the model optimization. This paper will present the methodology to define the resulting performance of the optimal thermal morphing anisogrid structure, minimum morphing control, and the systems frequency response capability as a function of available power.

Sign in / Sign up

Export Citation Format

Share Document