1
|
Adegboye OR, Ülker ED, Feda AK, Agyekum EB, Fendzi Mbasso W, Kamel S. Enhanced multi-layer perceptron for CO2 emission prediction with worst moth disrupted moth fly optimization (WMFO). Heliyon 2024; 10:e31850. [PMID: 38882359 PMCID: PMC11176760 DOI: 10.1016/j.heliyon.2024.e31850] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 01/26/2024] [Revised: 05/01/2024] [Accepted: 05/22/2024] [Indexed: 06/18/2024] Open
Abstract
This study introduces the Worst Moth Disruption Strategy (WMFO) to enhance the Moth Fly Optimization (MFO) algorithm, specifically addressing challenges related to population stagnation and low diversity. The WMFO aims to prevent local trapping of moths, fostering improved global search capabilities. Demonstrating a remarkable efficiency of 66.6 %, WMFO outperforms the MFO on CEC15 benchmark test functions. The Friedman and Wilcoxon tests further confirm WMFO's superiority over state-of-the-art algorithms. Introducing a hybrid model, WMFO-MLP, combining WMFO with a Multi-Layer Perceptron (MLP), facilitates effective parameter tuning for carbon emission prediction, achieving an outstanding total accuracy of 97.8 %. Comparative analysis indicates that the MLP-WMFO model surpasses alternative techniques in precision, reliability, and efficiency. Feature importance analysis reveals that variables such as Oil Efficiency and Economic Growth significantly impact MLP-WMFO's predictive power, contributing up to 40 %. Additionally, Gas Efficiency, Renewable Energy, Financial Risk, and Political Risk explain 26.5 %, 13.6 %, 8 %, and 6.5 %, respectively. Finally, WMFO-MLP performance offers advancements in optimization and predictive modeling with practical applications in carbon emission prediction.
Collapse
Affiliation(s)
| | - Ezgi Deniz Ülker
- Computer Engineering, European University of Lefke, Mersin-10, Turkey
| | - Afi Kekeli Feda
- Advanced Research Centre, European University of Lefke, Northern Cyprus, TR-10, Mersin, Turkey
| | - Ephraim Bonah Agyekum
- Department of Nuclear and Renewable Energy, Ural Federal University named after the first President of Russia Boris Yeltsin, 620002, 19 Mira Street, Ekaterinburg, Russia
| | - Wulfran Fendzi Mbasso
- Technology and Applied Sciences Laboratory, UIT of Douala, P.O. Box 8689, Douala, University of Douala, Cameroon
| | - Salah Kamel
- Electrical Engineering Department, Faculty of Engineering, Aswan University, 81542, Aswan, Egypt
| |
Collapse
|
2
|
Tu B, Wang F, Huo Y, Wang X. A hybrid algorithm of grey wolf optimizer and harris hawks optimization for solving global optimization problems with improved convergence performance. Sci Rep 2023; 13:22909. [PMID: 38129472 PMCID: PMC10739963 DOI: 10.1038/s41598-023-49754-2] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 09/02/2023] [Accepted: 12/12/2023] [Indexed: 12/23/2023] Open
Abstract
The grey wolf optimizer is an effective and well-known meta-heuristic algorithm, but it also has the weaknesses of insufficient population diversity, falling into local optimal solutions easily, and unsatisfactory convergence speed. Therefore, we propose a hybrid grey wolf optimizer (HGWO), based mainly on the exploitation phase of the harris hawk optimization. It also includes population initialization with Latin hypercube sampling, a nonlinear convergence factor with local perturbations, some extended exploration strategies. In HGWO, the grey wolves can have harris hawks-like flight capabilities during position updates, which greatly expands the search range and improves global searchability. By incorporating a greedy algorithm, grey wolves will relocate only if the new location is superior to the current one. This paper assesses the performance of the hybrid grey wolf optimizer (HGWO) by comparing it with other heuristic algorithms and enhanced schemes of the grey wolf optimizer. The evaluation is conducted using 23 classical benchmark test functions and CEC2020. The experimental results reveal that the HGWO algorithm performs well in terms of its global exploration ability, local exploitation ability, convergence speed, and convergence accuracy. Additionally, the enhanced algorithm demonstrates considerable advantages in solving engineering problems, thus substantiating its effectiveness and applicability.
Collapse
Affiliation(s)
- Binbin Tu
- College of Intelligent Science and Engineering, Shenyang University, Shenyang, China
| | - Fei Wang
- College of Information Engineering, Shenyang University, Shenyang, China.
| | - Yan Huo
- College of Information Engineering, Shenyang University, Shenyang, China
| | - Xiaotian Wang
- College of Intelligent Science and Engineering, Shenyang University, Shenyang, China
| |
Collapse
|
3
|
Kumar Sahoo S, Houssein EH, Premkumar M, Kumar Saha A, Emam MM. Self-adaptive moth flame optimizer combined with crossover operator and Fibonacci search strategy for COVID-19 CT image segmentation. EXPERT SYSTEMS WITH APPLICATIONS 2023; 227:120367. [PMID: 37193000 PMCID: PMC10163947 DOI: 10.1016/j.eswa.2023.120367] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Figures] [Subscribe] [Scholar Register] [Received: 01/23/2023] [Revised: 04/15/2023] [Accepted: 05/01/2023] [Indexed: 05/18/2023]
Abstract
The COVID-19 is one of the most significant obstacles that humanity is now facing. The use of computed tomography (CT) images is one method that can be utilized to recognize COVID-19 in early stage. In this study, an upgraded variant of Moth flame optimization algorithm (Es-MFO) is presented by considering a nonlinear self-adaptive parameter and a mathematical principle based on the Fibonacci approach method to achieve a higher level of accuracy in the classification of COVID-19 CT images. The proposed Es-MFO algorithm is evaluated using nineteen different basic benchmark functions, thirty and fifty dimensional IEEE CEC'2017 test functions, and compared the proficiency with a variety of other fundamental optimization techniques as well as MFO variants. Moreover, the suggested Es-MFO algorithm's robustness and durability has been evaluated with tests including the Friedman rank test and the Wilcoxon rank test, as well as a convergence analysis and a diversity analysis. Furthermore, the proposed Es-MFO algorithm resolves three CEC2020 engineering design problems to examine the problem-solving ability of the proposed method. The proposed Es-MFO algorithm is then used to solve the COVID-19 CT image segmentation problem using multi-level thresholding with the help of Otsu's method. Comparison results of the suggested Es-MFO with basic and MFO variants proved the superiority of the newly developed algorithm.
Collapse
Affiliation(s)
- Saroj Kumar Sahoo
- Department of Mathematics, National Institute of Technology Agartala, Tripura 799046, India
| | - Essam H Houssein
- Faculty of Computers and Information, Minia University, Minia, Egypt
| | - M Premkumar
- Department of Electrical and Electronics Engineering, Dayananda Sagar College of Engineering, Bengaluru, Karnataka 560078, India
| | - Apu Kumar Saha
- Department of Mathematics, National Institute of Technology Agartala, Tripura 799046, India
| | - Marwa M Emam
- Faculty of Computers and Information, Minia University, Minia, Egypt
| |
Collapse
|
4
|
Nadimi-Shahraki MH, Zamani H, Asghari Varzaneh Z, Mirjalili S. A Systematic Review of the Whale Optimization Algorithm: Theoretical Foundation, Improvements, and Hybridizations. ARCHIVES OF COMPUTATIONAL METHODS IN ENGINEERING : STATE OF THE ART REVIEWS 2023; 30:1-47. [PMID: 37359740 PMCID: PMC10220350 DOI: 10.1007/s11831-023-09928-7] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Figures] [Subscribe] [Scholar Register] [Received: 02/05/2023] [Accepted: 04/19/2023] [Indexed: 06/28/2023]
Abstract
Despite the simplicity of the whale optimization algorithm (WOA) and its success in solving some optimization problems, it faces many issues. Thus, WOA has attracted scholars' attention, and researchers frequently prefer to employ and improve it to address real-world application optimization problems. As a result, many WOA variations have been developed, usually using two main approaches improvement and hybridization. However, no comprehensive study critically reviews and analyzes WOA and its variants to find effective techniques and algorithms and develop more successful variants. Therefore, in this paper, first, the WOA is critically analyzed, then the last 5 years' developments of WOA are systematically reviewed. To do this, a new adapted PRISMA methodology is introduced to select eligible papers, including three main stages: identification, evaluation, and reporting. The evaluation stage was improved using three screening steps and strict inclusion criteria to select a reasonable number of eligible papers. Ultimately, 59 improved WOA and 57 hybrid WOA variants published by reputable publishers, including Springer, Elsevier, and IEEE, were selected as eligible papers. Effective techniques for improving and successful algorithms for hybridizing eligible WOA variants are described. The eligible WOA are reviewed in continuous, binary, single-objective, and multi/many-objective categories. The distribution of eligible WOA variants regarding their publisher, journal, application, and authors' country was visualized. It is also concluded that most papers in this area lack a comprehensive comparison with previous WOA variants and are usually compared only with other algorithms. Finally, some future directions are suggested.
Collapse
Affiliation(s)
- Mohammad H. Nadimi-Shahraki
- Faculty of Computer Engineering, Najafabad Branch, Islamic Azad University, Najafabad, 8514143131 Iran
- Big Data Research Center, Najafabad Branch, Islamic Azad University, Najafabad, 8514143131 Iran
| | - Hoda Zamani
- Faculty of Computer Engineering, Najafabad Branch, Islamic Azad University, Najafabad, 8514143131 Iran
- Big Data Research Center, Najafabad Branch, Islamic Azad University, Najafabad, 8514143131 Iran
| | - Zahra Asghari Varzaneh
- Department of Computer Science, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman, Kerman, Iran
| | - Seyedali Mirjalili
- Centre for Artificial Intelligence Research and Optimisation, Torrens University Australia, Brisbane, 4006 Australia
- University Research and Innovation Center, Obuda University, 1034 Budapest, Hungary
| |
Collapse
|
5
|
Oyelade ON, Agushaka JO, Ezugwu AE. Evolutionary binary feature selection using adaptive ebola optimization search algorithm for high-dimensional datasets. PLoS One 2023; 18:e0282812. [PMID: 36930670 PMCID: PMC10022820 DOI: 10.1371/journal.pone.0282812] [Citation(s) in RCA: 5] [Impact Index Per Article: 5.0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 10/17/2022] [Accepted: 02/23/2023] [Indexed: 03/18/2023] Open
Abstract
Feature selection problem represents the field of study that requires approximate algorithms to identify discriminative and optimally combined features. The evaluation and suitability of these selected features are often analyzed using classifiers. These features are locked with data increasingly being generated from different sources such as social media, surveillance systems, network applications, and medical records. The high dimensionality of these datasets often impairs the quality of the optimal combination of these features selected. The use of the binary optimization method has been proposed in the literature to address this challenge. However, the underlying deficiency of the single binary optimizer is transferred to the quality of the features selected. Though hybrid methods have been proposed, most still suffer from the inherited design limitation of the single combined methods. To address this, we proposed a novel hybrid binary optimization capable of effectively selecting features from increasingly high-dimensional datasets. The approach used in this study designed a sub-population selective mechanism that dynamically assigns individuals to a 2-level optimization process. The level-1 method first mutates items in the population and then reassigns them to a level-2 optimizer. The selective mechanism determines what sub-population is assigned for the level-2 optimizer based on the exploration and exploitation phase of the level-1 optimizer. In addition, we designed nested transfer (NT) functions and investigated the influence of the function on the level-1 optimizer. The binary Ebola optimization search algorithm (BEOSA) is applied for the level-1 mutation, while the simulated annealing (SA) and firefly (FFA) algorithms are investigated for the level-2 optimizer. The outcome of these are the HBEOSA-SA and HBEOSA-FFA, which are then investigated on the NT, and their corresponding variants HBEOSA-SA-NT and HBEOSA-FFA-NT with no NT applied. The hybrid methods were experimentally tested over high-dimensional datasets to address the challenge of feature selection. A comparative analysis was done on the methods to obtain performance variability with the low-dimensional datasets. Results obtained for classification accuracy for large, medium, and small-scale datasets are 0.995 using HBEOSA-FFA, 0.967 using HBEOSA-FFA-NT, and 0.953 using HBEOSA-FFA, respectively. Fitness and cost values relative to large, medium, and small-scale datasets are 0.066 and 0.934 using HBEOSA-FFA, 0.068 and 0.932 using HBEOSA-FFA, with 0.222 and 0.970 using HBEOSA-SA-NT, respectively. Findings from the study indicate that the HBEOSA-SA, HBEOSA-FFA, HBEOSA-SA-NT and HBEOSA-FFA-NT outperformed the BEOSA.
Collapse
Affiliation(s)
- Olaide N. Oyelade
- Department of Computer Science, Faculty of Physical Sciences, Ahmadu Bello University, Zaria, Nigeria
| | - Jeffrey O. Agushaka
- Unit for Data Science and Computing, North-West University, Potchefstroom, South Africa
| | - Absalom E. Ezugwu
- Unit for Data Science and Computing, North-West University, Potchefstroom, South Africa
- * E-mail:
| |
Collapse
|
6
|
Pan JS, Hu P, Snášel V, Chu SC. A survey on binary metaheuristic algorithms and their engineering applications. Artif Intell Rev 2022; 56:6101-6167. [PMID: 36466763 PMCID: PMC9684803 DOI: 10.1007/s10462-022-10328-9] [Citation(s) in RCA: 8] [Impact Index Per Article: 4.0] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/23/2022]
Abstract
This article presents a comprehensively state-of-the-art investigation of the engineering applications utilized by binary metaheuristic algorithms. Surveyed work is categorized based on application scenarios and solution encoding, and describes these algorithms in detail to help researchers choose appropriate methods to solve related applications. It is seen that transfer function is the main binary coding of metaheuristic algorithms, which usually adopts Sigmoid function. Among the contributions presented, there were different implementations and applications of metaheuristic algorithms, or the study of engineering applications by different objective functions such as the single- and multi-objective problems of feature selection, scheduling, layout and engineering structure optimization. The article identifies current troubles and challenges by the conducted review, and discusses that novel binary algorithm, transfer function, benchmark function, time-consuming problem and application integration are need to be resolved in future.
Collapse
Affiliation(s)
- Jeng-Shyang Pan
- College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, 266590 Shandong China
- Department of Information Management, Chaoyang University of Technology, Taichung, 413310 Taiwan
| | - Pei Hu
- Department of Information Management, Chaoyang University of Technology, Taichung, 413310 Taiwan
- School of Computer Science and Software Engineering, Nanyang Institute of Technology, Nanyang, 473004 Henan China
| | - Václav Snášel
- Faculty of Electrical Engineering and Computer Science, VŠB—Technical University of Ostrava, Ostrava, 70032 Moravskoslezský kraj Czech Republic
| | - Shu-Chuan Chu
- College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, 266590 Shandong China
| |
Collapse
|
7
|
Quantum-inspired metaheuristic algorithms: comprehensive survey and classification. Artif Intell Rev 2022. [DOI: 10.1007/s10462-022-10280-8] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/05/2022]
|
8
|
R. S, S. A. A, Y. V. RR, Sadiq AS. Traffic flow forecasting using natural selection based hybrid Bald Eagle Search-Grey Wolf optimization algorithm. PLoS One 2022; 17:e0275104. [PMID: 36162064 PMCID: PMC9512416 DOI: 10.1371/journal.pone.0275104] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 07/22/2022] [Accepted: 09/11/2022] [Indexed: 11/18/2022] Open
Abstract
In a fast-moving world, transportation consumes most of the time and resources. Traffic prediction has become a thrust application for machine learning algorithms to overcome the hurdles faced by congestion. Its accuracy determines the selection and existence of machine learning algorithms. The accuracy of such an algorithm is improved better by the proper tuning of the parameters. Support Vector Regression (SVR) is a well-known prediction mechanism. This paper exploits the Hybrid Grey Wolf Optimization-Bald Eagle Search (GWO-BES) algorithm for tuning SVR parameters, wherein the GWO selection methods are of natural selection. SVR-GWO-BES with natural selection has error performance increases by 48% in Mean Absolute Percentage Error and Root Mean Square Error, with the help of Caltrans Performance Measurement System (PeMS) open-source data and Chennai city traffic data for traffic forecasting. It is also shown that the increasing population of search agents increases the performance.
Collapse
Affiliation(s)
- Sivakumar R.
- School of Electronics Engineering, Vellore Institute of Technology, Vellore, India
| | - Angayarkanni S. A.
- Department of Networking and Communication, School of Computing, SRM Institute of Science and Technology, Chengalpattu, India
| | - Ramana Rao Y. V.
- Department of Electronics and Communication, College of Engineering Guindy, Anna University, Chennai, India
| | - Ali Safaa Sadiq
- Department of Computer Science, Nottingham Trent University, Clifton Lane, NG11 8NS, Nottingham, UK
| |
Collapse
|
9
|
Sahoo SK, Saha AK, Ezugwu AE, Agushaka JO, Abuhaija B, Alsoud AR, Abualigah L. Moth Flame Optimization: Theory, Modifications, Hybridizations, and Applications. ARCHIVES OF COMPUTATIONAL METHODS IN ENGINEERING : STATE OF THE ART REVIEWS 2022; 30:391-426. [PMID: 36059575 PMCID: PMC9422949 DOI: 10.1007/s11831-022-09801-z] [Citation(s) in RCA: 2] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 06/05/2022] [Accepted: 07/27/2022] [Indexed: 05/29/2023]
Abstract
The Moth flame optimization (MFO) algorithm belongs to the swarm intelligence family and is applied to solve complex real-world optimization problems in numerous domains. MFO and its variants are easy to understand and simple to operate. However, these algorithms have successfully solved optimization problems in different areas such as power and energy systems, engineering design, economic dispatch, image processing, and medical applications. A comprehensive review of MFO variants is presented in this context, including the classic version, binary types, modified versions, hybrid versions, multi-objective versions, and application part of the MFO algorithm in various sectors. Finally, the evaluation of the MFO algorithm is presented to measure its performance compared to other algorithms. The main focus of this literature is to present a survey and review the MFO and its applications. Also, the concluding remark section discusses some possible future research directions of the MFO algorithm and its variants.
Collapse
Affiliation(s)
- Saroj Kumar Sahoo
- Department of Mathematics, National Institute of Technology Agartala, Agartala, Tripura 799046 India
| | - Apu Kumar Saha
- Department of Mathematics, National Institute of Technology Agartala, Agartala, Tripura 799046 India
| | - Absalom E. Ezugwu
- School of Computer Science, University of KwaZulu-Natal, King Edward Road, Pietermaritzburg Campus, Pietermaritzburg, 3201 KwaZulu-Natal South Africa
| | - Jeffrey O. Agushaka
- School of Computer Science, University of KwaZulu-Natal, King Edward Road, Pietermaritzburg Campus, Pietermaritzburg, 3201 KwaZulu-Natal South Africa
| | - Belal Abuhaija
- Department of Computer Science, Wenzhou - Kean University, Wenzhou, China
| | - Anas Ratib Alsoud
- Hourani Center for Applied Scientific Research, Al-Ahliyya Amman University, Amman, 19328 Jordan
| | - Laith Abualigah
- Hourani Center for Applied Scientific Research, Al-Ahliyya Amman University, Amman, 19328 Jordan
- Faculty of Information Technology, Middle East University, Amman, 11831 Jordan
| |
Collapse
|
10
|
Binary Approaches of Quantum-Based Avian Navigation Optimizer to Select Effective Features from High-Dimensional Medical Data. MATHEMATICS 2022. [DOI: 10.3390/math10152770] [Citation(s) in RCA: 5] [Impact Index Per Article: 2.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 01/16/2023]
Abstract
Many metaheuristic approaches have been developed to select effective features from different medical datasets in a feasible time. However, most of them cannot scale well to large medical datasets, where they fail to maximize the classification accuracy and simultaneously minimize the number of selected features. Therefore, this paper is devoted to developing an efficient binary version of the quantum-based avian navigation optimizer algorithm (QANA) named BQANA, utilizing the scalability of the QANA to effectively select the optimal feature subset from high-dimensional medical datasets using two different approaches. In the first approach, several binary versions of the QANA are developed using S-shaped, V-shaped, U-shaped, Z-shaped, and quadratic transfer functions to map the continuous solutions of the canonical QANA to binary ones. In the second approach, the QANA is mapped to binary space by converting each variable to 0 or 1 using a threshold. To evaluate the proposed algorithm, first, all binary versions of the QANA are assessed on different medical datasets with varied feature sizes, including Pima, HeartEW, Lymphography, SPECT Heart, PenglungEW, Parkinson, Colon, SRBCT, Leukemia, and Prostate tumor. The results show that the BQANA developed by the second approach is superior to other binary versions of the QANA to find the optimal feature subset from the medical datasets. Then, the BQANA was compared with nine well-known binary metaheuristic algorithms, and the results were statistically assessed using the Friedman test. The experimental and statistical results demonstrate that the proposed BQANA has merit for feature selection from medical datasets.
Collapse
|
11
|
Nadimi-Shahraki MH, Zamani H, Mirjalili S. Enhanced whale optimization algorithm for medical feature selection: A COVID-19 case study. Comput Biol Med 2022; 148:105858. [PMID: 35868045 DOI: 10.1016/j.compbiomed.2022.105858] [Citation(s) in RCA: 40] [Impact Index Per Article: 20.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 01/03/2022] [Revised: 06/15/2022] [Accepted: 07/08/2022] [Indexed: 01/01/2023]
Abstract
The whale optimization algorithm (WOA) is a prominent problem solver which is broadly applied to solve NP-hard problems such as feature selection. However, it and most of its variants suffer from low population diversity and poor search strategy. Introducing efficient strategies is highly demanded to mitigate these core drawbacks of WOA particularly for dealing with the feature selection problem. Therefore, this paper is devoted to proposing an enhanced whale optimization algorithm named E-WOA using a pooling mechanism and three effective search strategies named migrating, preferential selecting, and enriched encircling prey. The performance of E-WOA is evaluated and compared with well-known WOA variants to solve global optimization problems. The obtained results proved that the E-WOA outperforms WOA's variants. After E-WOA showed a sufficient performance, then, it was used to propose a binary E-WOA named BE-WOA to select effective features, particularly from medical datasets. The BE-WOA is validated using medical diseases datasets and compared with the latest high-performing optimization algorithms in terms of fitness, accuracy, sensitivity, precision, and number of features. Moreover, the BE-WOA is applied to detect coronavirus disease 2019 (COVID-19) disease. The experimental and statistical results prove the efficiency of the BE-WOA in searching the problem space and selecting the most effective features compared to comparative optimization algorithms.
Collapse
Affiliation(s)
- Mohammad H Nadimi-Shahraki
- Faculty of Computer Engineering, Najafabad Branch, Islamic Azad University, Najafabad, Iran; Big Data Research Center, Najafabad Branch, Islamic Azad University, Najafabad, Iran; Centre for Artificial Intelligence Research and Optimisation, Torrens University Australia, Brisbane, Australia.
| | - Hoda Zamani
- Faculty of Computer Engineering, Najafabad Branch, Islamic Azad University, Najafabad, Iran; Big Data Research Center, Najafabad Branch, Islamic Azad University, Najafabad, Iran
| | - Seyedali Mirjalili
- Centre for Artificial Intelligence Research and Optimisation, Torrens University Australia, Brisbane, Australia; Yonsei Frontier Lab, Yonsei University, Seoul, Republic of Korea
| |
Collapse
|
12
|
Efficient text document clustering approach using multi-search Arithmetic Optimization Algorithm. Knowl Based Syst 2022. [DOI: 10.1016/j.knosys.2022.108833] [Citation(s) in RCA: 5] [Impact Index Per Article: 2.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/14/2022]
|
13
|
Abstract
The Harris hawk optimizer is a recent population-based metaheuristics algorithm that simulates the hunting behavior of hawks. This swarm-based optimizer performs the optimization procedure using a novel way of exploration and exploitation and the multiphases of search. In this review research, we focused on the applications and developments of the recent well-established robust optimizer Harris hawk optimizer (HHO) as one of the most popular swarm-based techniques of 2020. Moreover, several experiments were carried out to prove the powerfulness and effectivness of HHO compared with nine other state-of-art algorithms using Congress on Evolutionary Computation (CEC2005) and CEC2017. The literature review paper includes deep insight about possible future directions and possible ideas worth investigations regarding the new variants of the HHO algorithm and its widespread applications.
Collapse
|
14
|
Zhao F, Bao H, Wang L, Cao J, Tang J, Jonrinaldi. A multipopulation cooperative coevolutionary whale optimization algorithm with a two-stage orthogonal learning mechanism. Knowl Based Syst 2022. [DOI: 10.1016/j.knosys.2022.108664] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/17/2022]
|
15
|
Guo J, Shi B, Yan K, Di Y, Tang J, Xiao H, Sato Y. A twinning bare bones particle swarm optimization algorithm. PLoS One 2022; 17:e0267197. [PMID: 35500006 PMCID: PMC9060357 DOI: 10.1371/journal.pone.0267197] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 01/16/2022] [Accepted: 04/04/2022] [Indexed: 11/19/2022] Open
Abstract
A twinning bare bones particle swarm optimization(TBBPSO) algorithm is proposed in this paper. The TBBPSO is combined by two operators, the twins grouping operator (TGO) and the merger operator (MO). The TGO aims at the reorganization of the particle swarm. Two particles will form as a twin and influence each other in subsequent iterations. In a twin, one particle is designed to do the global search while the other one is designed to do the local search. The MO aims at merging the twins and enhancing the search ability of the main group. Two operators work together to enhance the local minimum escaping ability of proposed methods. In addition, no parameter adjustment is needed in TBBPSO, which means TBBPSO can solve different types of optimization problems without previous information or parameter adjustment. In the benchmark functions test, the CEC2014 benchmark functions are used. Experimental results prove that proposed methods can present high precision results for various types of optimization problems.
Collapse
Affiliation(s)
- Jia Guo
- School of Information and Communication Engineering, Hubei University of Economics, Wuhan, China
| | - Binghua Shi
- School of Information and Communication Engineering, Hubei University of Economics, Wuhan, China
| | - Ke Yan
- Smart Business Department of China Construction Third Engineering Bureau Installation Engineering Co., Ltd., Wuhan, China
| | - Yi Di
- School of Information and Communication Engineering, Hubei University of Economics, Wuhan, China
| | - Jianyu Tang
- School of Information and Communication Engineering, Hubei University of Economics, Wuhan, China
| | - Haiyang Xiao
- School of Information and Communication Engineering, Hubei University of Economics, Wuhan, China
| | - Yuji Sato
- Faculty of Computer and Information Science, Hosei University, Tokyo, Japan
| |
Collapse
|
16
|
Abualigah L, Almotairi KH, Elaziz MA, Shehab M, Altalhi M. Enhanced Flow Direction Arithmetic Optimization Algorithm for mathematical optimization problems with applications of data clustering. ENGINEERING ANALYSIS WITH BOUNDARY ELEMENTS 2022; 138:13-29. [DOI: 10.1016/j.enganabound.2022.01.014] [Citation(s) in RCA: 9] [Impact Index Per Article: 4.5] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 09/02/2023]
|
17
|
Enhanced Brain Storm Optimization Algorithm Based on Modified Nelder–Mead and Elite Learning Mechanism. MATHEMATICS 2022. [DOI: 10.3390/math10081303] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 02/04/2023]
Abstract
Brain storm optimization algorithm (BSO) is a popular swarm intelligence algorithm. A significant part of BSO is to divide the population into different clusters with the clustering strategy, and the blind disturbance operator is used to generate offspring. However, this mechanism is easy to lead to premature convergence due to lacking effective direction information. In this paper, an enhanced BSO algorithm based on modified Nelder–Mead and elite learning mechanism (BSONME) is proposed to improve the performance of BSO. In the proposed BSONEM algorithm, the modified Nelder–Mead method is used to explore the effective evolutionary direction. The elite learning mechanism is used to guide the population to exploit the promising region, and the reinitialization strategy is used to alleviate the population stagnation caused by individual homogenization. CEC2014 benchmark problems and two engineering management prediction problems are used to assess the performance of the proposed BSONEM algorithm. Experimental results and statistical analyses show that the proposed BSONEM algorithm is competitive compared with several popular improved BSO algorithms.
Collapse
|
18
|
Enhanced Fuzzy Elephant Herding Optimization-Based OTSU Segmentation and Deep Learning for Alzheimer’s Disease Diagnosis. MATHEMATICS 2022. [DOI: 10.3390/math10081259] [Citation(s) in RCA: 3] [Impact Index Per Article: 1.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 02/07/2023]
Abstract
Several neurological illnesses and diseased sites have been studied, along with the anatomical framework of the brain, using structural MRI (sMRI). It is critical to diagnose Alzheimer’s disease (AD) patients in a timely manner to implement preventative treatments. The segmentation of brain anatomy and categorization of AD have received increased attention since they can deliver good findings spanning a vast range of information. The first research gap considered in this work is the real-time efficiency of OTSU segmentation, which is not high, despite its simplicity and good accuracy. A second issue is that feature extraction could be automated by implementing deep learning techniques. To improve picture segmentation’s real-timeliness, enhanced fuzzy elephant herding optimization (EFEHO) was used for OTSU segmentation, and named EFEHO-OTSU. The main contribution of this work is twofold. One is utilizing EFEHO in the recommended technique to seek the optimal segmentation threshold for the OTSU method. Second, dual attention multi-instance deep learning network (DA-MIDL) is recommended for the timely diagnosis of AD and its prodromal phase, mild cognitive impairment (MCI). Tests show that this technique converges faster and takes less time than the classic OTSU approach without reducing segmentation performance. This study develops a valuable tool for quick picture segmentation with good real-time efficiency. Compared to numerous conventional techniques, the suggested study attains improved categorization performance regarding accuracy and transferability.
Collapse
|
19
|
Non-Systematic Weighted Satisfiability in Discrete Hopfield Neural Network Using Binary Artificial Bee Colony Optimization. MATHEMATICS 2022. [DOI: 10.3390/math10071129] [Citation(s) in RCA: 2] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 12/18/2022]
Abstract
Recently, new variants of non-systematic satisfiability logic were proposed to govern Discrete Hopfield Neural Network. This new variant of satisfiability logical rule will provide flexibility and enhance the diversity of the neuron states in the Discrete Hopfield Neural Network. However, there is no systematic method to control and optimize the logical structure of non-systematic satisfiability. Additionally, the role of negative literals was neglected, reducing the expressivity of the information that the logical structure holds. This study proposed an additional optimization layer of Discrete Hopfield Neural Network called the logic phase that controls the distribution of negative literals in the logical structure. Hence, a new variant of non-systematic satisfiability named Weighted Random 2 Satisfiability was formulated. Thus, a proposed searching technique called the binary Artificial Bee Colony algorithm will ensure the correct distribution of the negative literals. It is worth mentioning that the binary Artificial Bee Colony has flexible and less free parameters where the modifications tackled on the objective function. Specifically, this study utilizes a binary Artificial Bee Colony algorithm by modifying the updating rule equation by using not and (NAND) logic gate operator. The performance of the binary Artificial Bee Colony will be compared with other variants of binary Artificial Bee Colony algorithms of different logic gate operators and conventional binary algorithms such as the Particle Swarm Optimization, Exhaustive Search, and Genetic Algorithm. The experimental results and comparison show that the proposed algorithm is compatible in finding the correct logical structure according to the initiate ratio of negative literal.
Collapse
|
20
|
Hybridizing of Whale and Moth-Flame Optimization Algorithms to Solve Diverse Scales of Optimal Power Flow Problem. ELECTRONICS 2022. [DOI: 10.3390/electronics11050831] [Citation(s) in RCA: 8] [Impact Index Per Article: 4.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/17/2022]
Abstract
The optimal power flow (OPF) is a practical problem in a power system with complex characteristics such as a large number of control parameters and also multi-modal and non-convex objective functions with inequality and nonlinear constraints. Thus, tackling the OPF problem is becoming a major priority for power engineers and researchers. Many metaheuristic algorithms with different search strategies have been developed to solve the OPF problem. Although, the majority of them suffer from stagnation, premature convergence, and local optima trapping during the optimization process, which results in producing low solution qualities, especially for real-world problems. This study is devoted to proposing an effective hybridizing of whale optimization algorithm (WOA) and a modified moth-flame optimization algorithm (MFO) named WMFO to solve the OPF problem. In the proposed WMFO, the WOA and the modified MFO cooperate to effectively discover the promising areas and provide high-quality solutions. A randomized boundary handling is used to return the solutions that have violated the permissible boundaries of search space. Moreover, a greedy selection operator is defined to assess the acceptance criteria of new solutions. Ultimately, the performance of the WMFO is scrutinized on single and multi-objective cases of different OPF problems including standard IEEE 14-bus, IEEE 30-bus, IEEE 39-bus, IEEE 57-bus, and IEEE118-bus test systems. The obtained results corroborate that the proposed algorithm outperforms the contender algorithms for solving the OPF problem.
Collapse
|
21
|
Selecting Some Variables to Update-Based Algorithm for Solving Optimization Problems. SENSORS 2022; 22:s22051795. [PMID: 35270941 PMCID: PMC8914702 DOI: 10.3390/s22051795] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 01/26/2022] [Revised: 02/16/2022] [Accepted: 02/21/2022] [Indexed: 11/17/2022]
Abstract
With the advancement of science and technology, new complex optimization problems have emerged, and the achievement of optimal solutions has become increasingly important. Many of these problems have features and difficulties such as non-convex, nonlinear, discrete search space, and a non-differentiable objective function. Achieving the optimal solution to such problems has become a major challenge. To address this challenge and provide a solution to deal with the complexities and difficulties of optimization applications, a new stochastic-based optimization algorithm is proposed in this study. Optimization algorithms are a type of stochastic approach for addressing optimization issues that use random scanning of the search space to produce quasi-optimal answers. The Selecting Some Variables to Update-Based Algorithm (SSVUBA) is a new optimization algorithm developed in this study to handle optimization issues in various fields. The suggested algorithm’s key principles are to make better use of the information provided by different members of the population and to adjust the number of variables used to update the algorithm population during the iterations of the algorithm. The theory of the proposed SSVUBA is described, and then its mathematical model is offered for use in solving optimization issues. Fifty-three objective functions, including unimodal, multimodal, and CEC 2017 test functions, are utilized to assess the ability and usefulness of the proposed SSVUBA in addressing optimization issues. SSVUBA’s performance in optimizing real-world applications is evaluated on four engineering design issues. Furthermore, the performance of SSVUBA in optimization was compared to the performance of eight well-known algorithms to further evaluate its quality. The simulation results reveal that the proposed SSVUBA has a significant ability to handle various optimization issues and that it outperforms other competitor algorithms by giving appropriate quasi-optimal solutions that are closer to the global optima.
Collapse
|
22
|
A Bearing Fault Diagnosis Method Based on Wavelet Packet Transform and Convolutional Neural Network Optimized by Simulated Annealing Algorithm. SENSORS 2022; 22:s22041410. [PMID: 35214312 PMCID: PMC8962982 DOI: 10.3390/s22041410] [Citation(s) in RCA: 10] [Impact Index Per Article: 5.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 12/28/2021] [Revised: 02/07/2022] [Accepted: 02/08/2022] [Indexed: 02/04/2023]
Abstract
Bearings are widely used in various electrical and mechanical equipment. As their core components, failures often have serious consequences. At present, most parameter adjustment methods are still manual adjustments of parameters. This adjustment method is easily affected by prior knowledge, easily falls into the local optimal solution, cannot obtain the global optimal solution, and requires a lot of resources. Therefore, this paper proposes a new method for bearing fault diagnosis based on wavelet packet transform and convolutional neural network optimized by a simulated annealing algorithm. Firstly, the original bearing vibration signal is extracted by wavelet packet transform to obtain the spectrogram, and then the obtained spectrogram is sent to the convolutional neural network for parameter adjustment, and finally the simulated annealing algorithm is used to adjust the parameters. To verify the effectiveness of the method, the bearing database of Case Western Reserve University is used for testing, and the traditional intelligent bearing fault diagnosis methods are compared. The results show that the new method for bearing fault diagnosis proposed in this paper has a better and more reliable diagnosis effect than the existing machine learning and deep learning methods.
Collapse
|
23
|
A Hybrid Imperialist Competitive Algorithm for the Distributed Unrelated Parallel Machines Scheduling Problem. Symmetry (Basel) 2022. [DOI: 10.3390/sym14020204] [Citation(s) in RCA: 2] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 01/25/2023] Open
Abstract
In this paper, the distributed unrelated parallel machines scheduling problem (DUPMSP) is studied and a hybrid imperialist competitive algorithm (HICA) is proposed to minimize total tardiness. All empires were categorized into three types: the strongest empire, the weakest empire, and other empires; the diversified assimilation was implemented by using different search operator in the different types of empires, and a novel imperialist competition was implemented among all empires except the strongest one. The knowledge-based local search was embedded. Extensive experiments were conducted to compare the HICA with other algorithms from the literature. The computational results demonstrated that new strategies were effective and the HICA is a promising approach to solving the DUPMSP.
Collapse
|