scholarly journals Application of grey wolf algorithm for solving engineering optimization problems

Tehnika ◽  
2021 ◽  
Vol 76 (1) ◽  
pp. 50-57
Author(s):  
Branislav Milenković ◽  
Mladen Krstić ◽  
Đorđe Jovanović
Keyword(s):  
Optimization Problems ◽  
Side Impact ◽  
Engineering Optimization ◽  
Grey Wolf ◽  
Grey Wolf Optimization ◽  
Engineering Problems ◽  
Speed Reducer ◽  
It Application ◽  
Grey Wolf Algorithm ◽  
Engineering Optimization Problems

This paper presents grey wolf optimization - GWO. After presenting the biological basis of GWO, it explains the method itself and then the main algorithms of the GWO method as well as their mathematical models. The Grey Wolf Algorithm (GWO) is presented in detail as well as the manner of its operation and it application to optimization examples of engineering problems, such as: optimization of speed reducer, pressure vessel, spring, car side impact, cone coupling and cantilever beam. At the end, the results obtained by the GWO method are compared to the results previously obtained by other methods.

Chaotic-based grey wolf optimizer for numerical and engineering optimization problems

2020 ◽  
Vol 12 (4) ◽  
pp. 371-398
Author(s):  
Chao Lu ◽  
Liang Gao ◽  
Xinyu Li ◽  
Chengyu Hu ◽  
Xuesong Yan ◽  
...  
Keyword(s):  
Optimization Problems ◽  
Grey Wolf Optimizer ◽  
Engineering Optimization ◽  
Grey Wolf ◽  
Engineering 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.

Parameter Sensitivity Analysis of a Large-Scale System With Several Components Interacting in Series

1989 ◽  
Author(s):  
H. Torab
Keyword(s):  
Sensitivity Analysis ◽  
Large Scale ◽  
Optimization Problems ◽  
Parameter Sensitivity ◽  
Engineering Optimization ◽  
Parameter Sensitivity Analysis ◽  
Large Scale Systems ◽  
In Series ◽  
Special Case ◽  
Engineering Optimization Problems

Abstract Parameter sensitivity for large-scale systems that include several components which interface in series is presented. Large-scale systems can be divided into components or sub-systems to avoid excessive calculations in determining their optimum design. Model Coordination Method of Decomposition (MCMD) is one of the most commonly used methods to solve large-scale engineering optimization problems. In the Model Coordination Method of Decomposition, the vector of coordinating variables can be partitioned into two sub-vectors for systems with several components interacting in series. The first sub-vector consists of those variables that are common among all or most of the elements. The other sub-vector consists of those variables that are common between only two components that are in series. This study focuses on a parameter sensitivity analysis for this special case using MCMD.

scholarly journals A Novel Coverage Optimization Strategy Based on Grey Wolf Algorithm Optimized by Simulated Annealing for Wireless Sensor Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Yong Zhang ◽  
Li Cao ◽  
Yinggao Yue ◽  
Yong Cai ◽  
Bo Hang
Keyword(s):  
Wireless Sensor Networks ◽  
Simulated Annealing ◽  
Sensor Networks ◽  
Optimization Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Grey Wolf ◽  
Grey Wolf Optimization ◽  
Coverage Optimization ◽  
Grey Wolf Algorithm

The coverage optimization problem of wireless sensor network has become one of the hot topics in the current field. Through the research on the problem of coverage optimization, the coverage of the network can be improved, the distribution redundancy of the sensor nodes can be reduced, the energy consumption can be reduced, and the network life cycle can be prolonged, thereby ensuring the stability of the entire network. In this paper, a novel grey wolf algorithm optimized by simulated annealing is proposed according to the problem that the sensor nodes have high aggregation degree and low coverage rate when they are deployed randomly. Firstly, the mathematical model of the coverage optimization of wireless sensor networks is established. Secondly, in the process of grey wolf optimization algorithm, the simulated annealing algorithm is embedded into the grey wolf after the siege behavior ends and before the grey wolf is updated to enhance the global optimization ability of the grey wolf algorithm and at the same time improve the convergence rate of the grey wolf algorithm. Simulation experiments show that the improved grey wolf algorithm optimized by simulated annealing is applied to the coverage optimization of wireless sensor networks. It has better effect than particle swarm optimization algorithm and standard grey wolf optimization algorithm, has faster optimization speed, improves the coverage of the network, reduces the energy consumption of the nodes, and prolongs the network life cycle.

Sign in / Sign up

Export Citation Format

Share Document