Improving diversification by a hybrid bat-Nelder-Mead algorithm and DDE for rapid convergence to solve global optimization
Delay differential equations and algorithms hold a crucial position in the exploration of some biological systems and several models in real-world applications. So, some algorithms contribute to improve mathematical models related to natural life problems and global optimization. A novel hybridizati...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2024-12-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/doi/10.3934/math.20241692 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832590722187919360 |
|---|---|
| author | Enas Suhail Mahmoud El-Alem Omar Bazighifan Ahmed Zekri |
| author_facet | Enas Suhail Mahmoud El-Alem Omar Bazighifan Ahmed Zekri |
| author_sort | Enas Suhail |
| collection | DOAJ |
| description | Delay differential equations and algorithms hold a crucial position in the exploration of some biological systems and several models in real-world applications. So, some algorithms contribute to improve mathematical models related to natural life problems and global optimization. A novel hybridization between the downhill Nelder-Mead simplex algorithm (NM) and the classic bat algorithm (BA) was presented. The classic BA suffers from premature convergence, which is due to its global search weakness. In this research, this weakness was overcome by the intervention of NM in the velocity updating formula of the particles as an additional term. This improvement distracts particles from the rapporteur route, toward only the best solution found, to discover the search space more accurately. Once this improvement detects a promising area, sequential expansions are performed to deeply explore the area. This mechanism provides rapid convergence for the algorithm. Deep analysis of the algorithm's behaviour was provided, and thoughtful experiments were conducted and evaluated utilizing several evaluation metrics together with the Wilcoxon signed rank test to accentuate the effectiveness and efficiency of the proposed algorithm. |
| format | Article |
| id | doaj-art-068e718e22bc4a428b2a12b589c5d00e |
| institution | Kabale University |
| issn | 2473-6988 |
| language | English |
| publishDate | 2024-12-01 |
| publisher | AIMS Press |
| record_format | Article |
| series | AIMS Mathematics |
| spelling | doaj-art-068e718e22bc4a428b2a12b589c5d00e2025-01-23T07:53:25ZengAIMS PressAIMS Mathematics2473-69882024-12-01912356553567710.3934/math.20241692Improving diversification by a hybrid bat-Nelder-Mead algorithm and DDE for rapid convergence to solve global optimizationEnas Suhail0Mahmoud El-Alem1Omar Bazighifan2Ahmed Zekri3Department of Mathematics and Computer Science, Faculty of Science, Alexandria University, Alexandria, EgyptDepartment of Mathematics and Computer Science, Faculty of Science, Alexandria University, Alexandria, EgyptDepartment of Mathematics, Faculty of Education, Seiyun University, Hadhramout, YemenDepartment of Mathematics and Computer Science, Faculty of Science, Alexandria University, Alexandria, EgyptDelay differential equations and algorithms hold a crucial position in the exploration of some biological systems and several models in real-world applications. So, some algorithms contribute to improve mathematical models related to natural life problems and global optimization. A novel hybridization between the downhill Nelder-Mead simplex algorithm (NM) and the classic bat algorithm (BA) was presented. The classic BA suffers from premature convergence, which is due to its global search weakness. In this research, this weakness was overcome by the intervention of NM in the velocity updating formula of the particles as an additional term. This improvement distracts particles from the rapporteur route, toward only the best solution found, to discover the search space more accurately. Once this improvement detects a promising area, sequential expansions are performed to deeply explore the area. This mechanism provides rapid convergence for the algorithm. Deep analysis of the algorithm's behaviour was provided, and thoughtful experiments were conducted and evaluated utilizing several evaluation metrics together with the Wilcoxon signed rank test to accentuate the effectiveness and efficiency of the proposed algorithm.https://www.aimspress.com/article/doi/10.3934/math.20241692non-linear optimizationbat algorithmnelder-mead algorithmmetaheuristicsnumerical comparison |
| spellingShingle | Enas Suhail Mahmoud El-Alem Omar Bazighifan Ahmed Zekri Improving diversification by a hybrid bat-Nelder-Mead algorithm and DDE for rapid convergence to solve global optimization AIMS Mathematics non-linear optimization bat algorithm nelder-mead algorithm metaheuristics numerical comparison |
| title | Improving diversification by a hybrid bat-Nelder-Mead algorithm and DDE for rapid convergence to solve global optimization |
| title_full | Improving diversification by a hybrid bat-Nelder-Mead algorithm and DDE for rapid convergence to solve global optimization |
| title_fullStr | Improving diversification by a hybrid bat-Nelder-Mead algorithm and DDE for rapid convergence to solve global optimization |
| title_full_unstemmed | Improving diversification by a hybrid bat-Nelder-Mead algorithm and DDE for rapid convergence to solve global optimization |
| title_short | Improving diversification by a hybrid bat-Nelder-Mead algorithm and DDE for rapid convergence to solve global optimization |
| title_sort | improving diversification by a hybrid bat nelder mead algorithm and dde for rapid convergence to solve global optimization |
| topic | non-linear optimization bat algorithm nelder-mead algorithm metaheuristics numerical comparison |
| url | https://www.aimspress.com/article/doi/10.3934/math.20241692 |
| work_keys_str_mv | AT enassuhail improvingdiversificationbyahybridbatneldermeadalgorithmandddeforrapidconvergencetosolveglobaloptimization AT mahmoudelalem improvingdiversificationbyahybridbatneldermeadalgorithmandddeforrapidconvergencetosolveglobaloptimization AT omarbazighifan improvingdiversificationbyahybridbatneldermeadalgorithmandddeforrapidconvergencetosolveglobaloptimization AT ahmedzekri improvingdiversificationbyahybridbatneldermeadalgorithmandddeforrapidconvergencetosolveglobaloptimization |