Fuzzy adaptive emperor penguin optimizer for global optimization problems

• 第一著者: Md Abdul, Kader
• フォーマット: 学位論文
• 言語: 英語
• 出版事項: 2023
• 主題: QA75 Electronic computers. Computer science; QA76 Computer software
• オンライン･アクセス: http://umpir.ump.edu.my/id/eprint/39231/1/ir.Fuzzy%20adaptive%20emperor%20penguin%20optimizer%20for%20global%20optimization%20problems.pdf

The Emperor Penguin Optimizer (EPO) is a recently developed population-based metaheuristic algorithm that simulates the huddling behaviour of emperor penguins. Mixed results have been observed in the performance of EPO in solving general optimization problems. Within the EPO, two parameters need to be tuned (namely f and l) to ensure a good balance between exploration (i.e., roaming unknown locations) and exploitation (i.e., manipulating the current known best). Since the search contour varies depending on the optimization problem, the tuning of parameters f and l is problem-dependent, and there is no one-size-fits-all approach. To alleviate this parameter tuning problem, an adaptive mechanism can be introduced in EPO. This research work proposes a fuzzy adaptive variant of EPO, namely FAEPO, to solve this problem. As the name suggests, FAEPO can adaptively tune the parameters f and l throughout the search based on three measures (i.e., quality, success rate, and diversity of the current search) via fuzzy decisions. A test suite of twelve benchmark test functions and three global optimization problems: Team Formation Optimization (TFO), Low Autocorrelation Binary Sequence (LABS), and Modified Condition/ Decision coverage (MC/DC) test case generation problem were solved using the proposed algorithm. The respective solution results of the competing metaheuristic algorithms were compared. The experimental results demonstrate that FAEPO significantly improved the performance especially of its predecessor (EPO), an improved variant of EPO (i.e., IEPO), and a fuzzy-based variant of ChOA (i.e., FChOA) and gives superior performance against the competing metaheuristic algorithms. Moreover, the proposed FAEPO requires 50% less fitness function evaluation in each iteration than the ancestor EPO and exhibits competitive performance in terms of convergence and computational time against its predecessor (EPO) and other competing meta-heuristic algorithms with a 90% confidence level.