Modified crayfish optimization algorithm for solving multiple engineering application problems
Gespeichert in:
| Titel: | Modified crayfish optimization algorithm for solving multiple engineering application problems |
|---|---|
| Autoren: | Jia, Heming, Zhou, Xuelian, Zhang, Jinrui, Abualigah, Laith, Yildiz, Ali Riza, Hussien, Abdelazim |
| Quelle: | Artificial Intelligence Review. 57(5) |
| Schlagwörter: | Crayfish Optimization Algorithm, Environmental updating mechanism, Ghost opposition-based learning strategy, Global optimization problem, Constrained engineering design problems, High dimensional feature selection |
| Beschreibung: | Crayfish Optimization Algorithm (COA) is innovative and easy to implement, but the crayfish search efficiency decreases in the later stage of the algorithm, and the algorithm is easy to fall into local optimum. To solve these problems, this paper proposes an modified crayfish optimization algorithm (MCOA). Based on the survival habits of crayfish, MCOA proposes an environmental renewal mechanism that uses water quality factors to guide crayfish to seek a better environment. In addition, integrating a learning strategy based on ghost antagonism into MCOA enhances its ability to evade local optimality. To evaluate the performance of MCOA, tests were performed using the IEEE CEC2020 benchmark function and experiments were conducted using four constraint engineering problems and feature selection problems. For constrained engineering problems, MCOA is improved by 11.16%, 1.46%, 0.08% and 0.24%, respectively, compared with COA. For feature selection problems, the average fitness value and accuracy are improved by 55.23% and 10.85%, respectively. MCOA shows better optimization performance in solving complex spatial and practical application problems. The combination of the environment updating mechanism and the learning strategy based on ghost antagonism significantly improves the performance of MCOA. This discovery has important implications for the development of the field of optimization. |
| Dateibeschreibung: | electronic |
| Zugangs-URL: | https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-203444 https://liu.diva-portal.org/smash/get/diva2:1857760/FULLTEXT01.pdf |
| Datenbank: | SwePub |
Full Text Finder 
Nájsť tento článok vo Web of Science | Abstract: | Crayfish Optimization Algorithm (COA) is innovative and easy to implement, but the crayfish search efficiency decreases in the later stage of the algorithm, and the algorithm is easy to fall into local optimum. To solve these problems, this paper proposes an modified crayfish optimization algorithm (MCOA). Based on the survival habits of crayfish, MCOA proposes an environmental renewal mechanism that uses water quality factors to guide crayfish to seek a better environment. In addition, integrating a learning strategy based on ghost antagonism into MCOA enhances its ability to evade local optimality. To evaluate the performance of MCOA, tests were performed using the IEEE CEC2020 benchmark function and experiments were conducted using four constraint engineering problems and feature selection problems. For constrained engineering problems, MCOA is improved by 11.16%, 1.46%, 0.08% and 0.24%, respectively, compared with COA. For feature selection problems, the average fitness value and accuracy are improved by 55.23% and 10.85%, respectively. MCOA shows better optimization performance in solving complex spatial and practical application problems. The combination of the environment updating mechanism and the learning strategy based on ghost antagonism significantly improves the performance of MCOA. This discovery has important implications for the development of the field of optimization. |
|---|---|
| ISSN: | 02692821 15737462 |
| DOI: | 10.1007/s10462-024-10738-x |