Optimizing Constrained Engineering Optimization Problems Using Improved Mountain Gazelle Optimizer

被引:0
作者
Pham, Vu Hong Son [1 ]
Dang, Nghiep Trinh Nguyen [1 ]
Nguyen, Van Nam [1 ]
机构
[1] Vietnam Natl Univ VNU HCM, Ho Chi Minh City Univ Technol HCMUT, Fac Civil Engn, Ho Chi Minh City, Vietnam
关键词
benchmark; engineering optimization; evolutionary algorithm; mountain gazelle optimizer; swarm-based algorithm; VARIABLE NEIGHBORHOOD SEARCH; ALGORITHM; INTEGER;
D O I
10.1155/acis/1922567
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This study introduces a novel approach to engineering design optimization through the development of an improved mountain gazelle optimizer (iMGO) that incorporates variable neighborhood search (VNS) techniques. The enhanced algorithm effectively addresses engineering optimization challenges by identifying optimal design solutions within specified constraints. In particular, iMGO significantly improves solution diversity and mitigates the risk of premature convergence to local optima, thereby overcoming the limitations of the original MGO. A comprehensive analysis was conducted using 12 functions from the CEC 2022 benchmark suite, and the algorithm was applied to five engineering problems, including the design of an I-beam, pressure vessel, three-bar truss, cantilever beam, and tension spring. Comparative results indicate that iMGO outperforms established metaheuristic techniques, such as MFO, WOA, GOA, MPA, TSO, and SCSO, as well as the original MGO. The results validate iMGO's effectiveness in navigating the complexities of constrained engineering optimization. For instance, in practical applications, the manufacturing cost of the pressure vessel design was reduced from 6014.4537 to 5915.3358, and the weight of the tension spring was decreased from 0.0149154 to 0.0130101 relative to the original MGO. These enhancements underscore the significant potential of iMGO in real-world applications across aerospace engineering, structural design optimization, energy system planning, and other fields, thereby contributing to more efficient and sustainable engineering solutions.
引用
收藏
页数:22
相关论文
共 61 条
[1]   Mountain Gazelle Optimizer: A new Nature-inspired Metaheuristic Algorithm for Global Optimization Problems [J].
Abdollahzadeh, Benyamin ;
Gharehchopogh, Farhad Soleimanian ;
Khodadadi, Nima ;
Mirjalili, Seyedali .
ADVANCES IN ENGINEERING SOFTWARE, 2022, 174
[2]   Opposition-based sine cosine optimizer utilizing refraction learning and variable neighborhood search for feature selection [J].
Abed-alguni, Bilal H. ;
Alawad, Noor Aldeen ;
Al-Betar, Mohammed Azmi ;
Paul, David .
APPLIED INTELLIGENCE, 2023, 53 (11) :13224-13260
[3]  
Abhishek Kumar KVP, 2021, PROBLEM DEFINITIONS
[4]   The Arithmetic Optimization Algorithm [J].
Abualigah, Laith ;
Diabat, Ali ;
Mirjalili, Seyedali ;
Elaziz, Mohamed Abd ;
Gandomi, Amir H. .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2021, 376
[5]  
Ahmed M., 2024, J Artif Intell Metaheuristics, V8, P1, DOI [10.54216/JAIM.080101, DOI 10.54216/JAIM.080101]
[6]   Discrete hybrid cuckoo search and simulated annealing algorithm for solving the job shop scheduling problem [J].
Alkhateeb, Faisal ;
Abed-alguni, Bilal H. ;
Al-rousan, Mohammad Hani .
JOURNAL OF SUPERCOMPUTING, 2022, 78 (04) :4799-4826
[7]   Improved discrete salp swarm algorithm using exploration and exploitation techniques for feature selection in intrusion detection systems [J].
Barhoush, Malek ;
Abed-alguni, Bilal H. ;
Al-qudah, Nour Elhuda A. .
JOURNAL OF SUPERCOMPUTING, 2023, 79 (18) :21265-21309
[8]   Evolving chimp optimization algorithm by weighted opposition-based technique and greedy search for multimodal engineering problems [J].
Bo, Qiuyu ;
Cheng, Wuqun ;
Khishe, Mohammad .
APPLIED SOFT COMPUTING, 2023, 132
[9]  
Cagnina LC, 2008, INFORM-J COMPUT INFO, V32, P319
[10]   OPTIMIZATION WITH DISCRETE VARIABLES VIA RECURSIVE QUADRATIC-PROGRAMMING .2. ALGORITHM AND RESULTS [J].
CHA, JZ ;
MAYNE, RW .
JOURNAL OF MECHANISMS TRANSMISSIONS AND AUTOMATION IN DESIGN-TRANSACTIONS OF THE ASME, 1989, 111 (01) :130-136