An Evolutionary Dynamic Control Cuckoo Search Algorithm for Solving the Constrained Engineering Design Problems

An Evolutionary Dynamic Control Cuckoo Search Algorithm for Solving the Constrained Engineering Design Problems

Manoj Kumar Naik, Monorama Swain, Rutuparna Panda, Ajith Abraham
Copyright: © 2022 |Pages: 25
DOI: 10.4018/IJSIR.314210
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

The key contribution of this work is the dynamic control cuckoo search (DCCS) method. Nonetheless, the adaptive cuckoo search (ACS) appears to be effective in utilizing the exploitation and exploration by using the best solution followed by an adaptive step size to determine the next-generation solutions. However, its convergence rate is limited. To solve this problem, the authors use dynamic control, adaptive step size, and randomization in the cuckoo search path for the following generations. A better tradeoff between exploitation and exploration is achieved, allowing for a faster convergence rate. The 23 traditional and 10 CEC2019 benchmark functions are used for validations. When the DCCS results are compared to the well-known methods using scalability and statistical tests like Wilcoxon's rank-sum test, it shows a significant improvement. Friedman's mean rank test is also ranked the strategic DCCS top. Furthermore, constrained engineering design problems 1) welded beam design and 2) pressure vessel design are solved. The DCCS would be useful for optimization.
Article Preview
Top

Introduction

The process of obtaining the best solution for a given problem under the specified conditions is known as optimization. There are two types of mathematical optimization: (1) deterministic optimization and (2) stochastic optimization. The deterministic approaches search the space for the best potential solution using the problem's gradient information. The most successful deterministic methods are linear/nonlinear programming (Luenberger & Ye, 1984) and convex optimization (Boyd et al., 2004). The stochastic technique, on the other hand, uses a random probable answer that is checked by the statistical analysis to arrive at an optimal solution (Izonin et al., 2021), like the meta-heuristic algorithm that generates and uses random variables. These algorithms employ a global search strategy to find a global or near-global solution across the problem domain. Simple, gradient-free, adaptable, and problem-independent metaheuristic algorithms have always been desirable (Faramarzi, Heidarinejad, Stephens, et al., 2020). For easier reading, the symbols and abbreviations are provided in Table 1.

Table 1.
Symbols and abbreviations
Symbols
IJSIR.314210.m01Abandoned chanceIJSIR.314210.m02Best Fitness
IJSIR.314210.m03Number of CuckoosIJSIR.314210.m04Worst fitness
IJSIR.314210.m05Problem dimensionIJSIR.314210.m06A random number from the normal distribution
IJSIR.314210.m07Nest (solution)IJSIR.314210.m08Adaptive step size
IJSIR.314210.m09Upper boundariesIJSIR.314210.m10Maximum generation
IJSIR.314210.m11Lower boundariesIJSIR.314210.m12Chance factor
IJSIR.314210.m13Random numberIJSIR.314210.m14Global best solution
IJSIR.314210.m15GenerationIJSIR.314210.m16 , IJSIR.314210.m17index
IJSIR.314210.m18 , IJSIR.314210.m19Step sizeavgMean fitness
IJSIR.314210.m20Fitness valuestdStandard deviation
Abbreviations
ABCArtificial Bee ColonyGOAGrasshopper Optimisation Algorithm
ABOArtificial Butterfly OptimizationGSAGravitational Search Algorithm
ACOAnt Colony OptimizationGWOGray Wolf Optimizer
ACSAdaptive Cuckoo SearchHBAHoney Badger Algorithm
ALOAnt Lion OptimizerHFAHuman Felicity Algorithm
AOAArithmetic Optimization AlgorithmHGSOHenry Gas Solubility Optimization
ASOAtom Search OptimizationHHOHarris Hawks Optimization
AVOAAfrican Vultures Optimization AlgorithmKHAKrill Herd Algorithm
BBOBiogeography-Based OptimizationLSALightning Search Algorithm
BFOABacterial Foraging Optimization AlgorithmMBOMonarch Butterfly Optimization
BMOBarnacles Mating OptimizerMPAMarine Predators Algorithm
BWOBlack Widow OptimizationMRFOManta Ray Foraging Optimization
CECCongress on Evolutionary ComputationPSOParticle Swarm Optimization
ChOAChimp Optimization AlgorithmSASimulated Annealing
CROACoral Reefs Optimization AlgorithmSFOSailfish Optimizer
CSCuckoo SearchSISwarm Intelligence
CSACrow Search AlgorithmSMASlime Mould Algorithm
DCCSDynamic Control Cuckoo SearchSOASeagull Optimization Algorithm
DEDifferential EvolutionSSASquirrel Search Algorithm
EAsEvolutionary AlgorithmsTLBOTeaching–Learning-Based Optimization
EOEquilibrium OptimizerVCSVirus Colony Search
ESAElectro-Search AlgorithmVPLVolleyball Premier League
FAFirefly AlgorithmWCAWater Cycle Algorithm
FDAFlow Direction AlgorithmWDOWind Driven Optimization
GAGenetic AlgorithmWOAWhale Optimization Algorithm

Complete Article List

Search this Journal:
Reset
Volume 15: 1 Issue (2024)
Volume 14: 3 Issues (2023)
Volume 13: 4 Issues (2022)
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing