TY - JOUR
T1 - A novel chaotic Runge Kutta optimization algorithm for solving constrained engineering problems
AU - Ylldlz, Betül Sultan
AU - Mehta, Pranav
AU - Panagant, Natee
AU - Mirjalili, Seyedali
AU - Yildiz, Ali Riza
N1 - Funding Information:
Natee Panagant (Grant No. N42A650549) is funded by National Research Council Thailand (NRCT).
Publisher Copyright:
© 2022 The Author(s).
PY - 2022/12/1
Y1 - 2022/12/1
N2 - This study proposes a novel hybrid metaheuristic optimization algorithm named chaotic Runge Kutta optimization (CRUN). In this study, 10 diverse chaotic maps are being incorporated with the base Runge Kutta optimization (RUN) algorithm to improve their performance. An imperative analysis was conducted to check CRUN's convergence proficiency, sustainability of critical constraints, and effectiveness. The proposed algorithm was tested on six well-known design engineering tasks, namely: gear train design, coupling with a bolted rim, pressure vessel design, Belleville spring, and vehicle brake-pedal optimization. The results demonstrate that CRUN is superior compared to state-of-the-art algorithms in the literature. So, in each case study, CRUN was superior to the rest of the algorithms and furnished the best-optimized parameters with the least deviation. In this study, 10 chaotic maps were enhanced with the base RUN algorithm. However, these chaotic maps improve the solution quality, prevent premature convergence, and yield the global optimized output. Accordingly, the proposed CRUN algorithm can also find superior aspects in various spectrums of managerial implications such as supply chain management, business models, fuzzy circuits, and management models.
AB - This study proposes a novel hybrid metaheuristic optimization algorithm named chaotic Runge Kutta optimization (CRUN). In this study, 10 diverse chaotic maps are being incorporated with the base Runge Kutta optimization (RUN) algorithm to improve their performance. An imperative analysis was conducted to check CRUN's convergence proficiency, sustainability of critical constraints, and effectiveness. The proposed algorithm was tested on six well-known design engineering tasks, namely: gear train design, coupling with a bolted rim, pressure vessel design, Belleville spring, and vehicle brake-pedal optimization. The results demonstrate that CRUN is superior compared to state-of-the-art algorithms in the literature. So, in each case study, CRUN was superior to the rest of the algorithms and furnished the best-optimized parameters with the least deviation. In this study, 10 chaotic maps were enhanced with the base RUN algorithm. However, these chaotic maps improve the solution quality, prevent premature convergence, and yield the global optimized output. Accordingly, the proposed CRUN algorithm can also find superior aspects in various spectrums of managerial implications such as supply chain management, business models, fuzzy circuits, and management models.
KW - brake pedal
KW - chaotic maps
KW - hybrid metaheuristics
KW - mechanical design
KW - Runge Kutta optimization algorithm
UR - http://www.scopus.com/inward/record.url?scp=85158051263&partnerID=8YFLogxK
U2 - 10.1093/jcde/qwac113
DO - 10.1093/jcde/qwac113
M3 - Article
AN - SCOPUS:85158051263
SN - 2288-4300
VL - 9
SP - 2452
EP - 2465
JO - Journal of Computational Design and Engineering
JF - Journal of Computational Design and Engineering
IS - 6
M1 - qwac113
ER -