1
|
Su H, Zhao D, Yu F, Heidari AA, Xu Z, Alotaibi FS, Mafarja M, Chen H. A horizontal and vertical crossover cuckoo search: optimizing performance for the engineering problems. JOURNAL OF COMPUTATIONAL DESIGN AND ENGINEERING 2023; 10:36-64. [DOI: 10.1093/jcde/qwac112] [Citation(s) in RCA: 1] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 08/01/2024]
Abstract
Abstract
As science and technology advance, more engineering-type problems emerge. Technology development has likewise led to an increase in the complexity of optimization problems, and the need for new optimization techniques has increased. The swarm intelligence optimization algorithm is popular among researchers as a flexible, gradient-independent optimization method. The cuckoo search (CS) algorithm in the population intelligence algorithm has been widely used in various fields as a classical optimization algorithm. However, the current CS algorithm can no longer satisfy the performance requirements of the algorithm for current optimization problems. Therefore, in this paper, an improved CS algorithm based on a crossover optimizer (CC) and decentralized foraging (F) strategy is proposed to improve the search ability and the ability to jump out of the local optimum of the CS algorithm (CCFCS). Then, in order to verify the performance of the algorithm, this paper demonstrates the performance of CCFCS from six perspectives: core parameter setting, balance analysis of search and exploitation, the impact of introduced strategies, the impact of population dimension, and comparison with classical algorithms and similar improved algorithms. Finally, the optimization effect of CCFCS on real engineering problems is tested by five classic cases of engineering optimization. According to the experimental results, CCFCS has faster convergence and higher solution quality in the algorithm performance test and maintains the same excellent performance in engineering applications.
Collapse
Affiliation(s)
- Hang Su
- College of Computer Science and Technology, Changchun Normal University , Changchun, Jilin 130032, China
| | - Dong Zhao
- College of Computer Science and Technology, Changchun Normal University , Changchun, Jilin 130032, China
| | - Fanhua Yu
- College of Computer Science and Technology, Changchun Normal University , Changchun, Jilin 130032, China
| | - Ali Asghar Heidari
- College of Computer Science and Artificial Intelligence, Wenzhou University , Wenzhou, Zhejiang 325035, China
| | - Zhangze Xu
- College of Computer Science and Artificial Intelligence, Wenzhou University , Wenzhou, Zhejiang 325035, China
| | - Fahd S Alotaibi
- Faculty of Computing and Information Technology, King Abdulaziz University , Jeddah 21589, Saudi Arabia
| | - Majdi Mafarja
- Department of Computer Science, Birzeit University , PO Box 14, Birzeit, West Bank, Palestine
- Faculty of Computing and Information Technology, King Abdulaziz University , Jeddah 21589, Saudi Arabia
| | - Huiling Chen
- College of Computer Science and Artificial Intelligence, Wenzhou University , Wenzhou, Zhejiang 325035, China
| |
Collapse
|
2
|
Alsaeedi MAK, Kurnaz S. RETRACTED ARTICLE: Feature selection for diagnose coronavirus (COVID-19) disease by neural network and Caledonian crow learning algorithm. APPLIED NANOSCIENCE 2023; 13:3129. [PMID: 35155058 PMCID: PMC8818372 DOI: 10.1007/s13204-021-02159-x] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 09/15/2021] [Accepted: 10/09/2021] [Indexed: 11/07/2022]
Affiliation(s)
| | - Sefer Kurnaz
- Department of Electrical Computer Engineering, Altinbas University, Istanbul, Turkey
| |
Collapse
|
3
|
An Improved New Caledonian Crow Learning Algorithm for Global Function Optimization. COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE 2022; 2022:9248771. [PMID: 36262611 PMCID: PMC9576361 DOI: 10.1155/2022/9248771] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 06/29/2022] [Revised: 07/31/2022] [Accepted: 08/05/2022] [Indexed: 11/18/2022]
Abstract
The New Caledonian crow learning algorithm (NCCLA) is a novel metaheuristic algorithm inspired by the learning behavior of New Caledonian crows learning to make tools to obtain food. However, it suffers from the problems of easily falling into local optima and insufficient convergence accuracy and convergence precision. To further improve the convergence performance of NCCLA, an improved New Caledonian crow learning algorithm (INCCLA) is proposed in this paper. By determining the parent individuals based on the cosine similarity, the juveniles are guided to search toward different ranges to maintain the population diversity; a novel hybrid mechanism of complete and incomplete learning is proposed to balance the exploration and exploitation capabilities of the algorithm; the update strategy of juveniles and parent individuals is improved to enhance the convergence speed and precision of the algorithm. The test results of the CEC2013 and CEC2020 test suites show that, compared with the original NCCLA algorithm and four of the best metaheuristics to date, INCCLA has significant advantages in terms of convergence speed, convergence precision, and stability.
Collapse
|
4
|
Wu H, Zhang X, Song L, Zhang Y, Gu L, Zhao X. Wild Geese Migration Optimization Algorithm: A New Meta-Heuristic Algorithm for Solving Inverse Kinematics of Robot. COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE 2022; 2022:5191758. [PMID: 36337271 PMCID: PMC9630037 DOI: 10.1155/2022/5191758] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Received: 06/12/2022] [Revised: 07/21/2022] [Accepted: 08/18/2022] [Indexed: 08/26/2023]
Abstract
This paper proposes a new meta-heuristic algorithm, named wild geese migration optimization (GMO) algorithm. It is inspired by the social behavior of wild geese swarming in nature. They maintain a special formation for long-distance migration in small groups for survival and reproduction. The mathematical model is established based on these social behaviors to solve optimization problems. Meanwhile, the performance of the GMO algorithm is tested on the stable benchmark function of CEC2017, and its potential for dealing with practical problems is studied in five engineering design problems and the inverse kinematics solution of robot. The test results show that the GMO algorithm has excellent computational performance compared to other algorithms. The practical application results show that the GMO algorithm has strong applicability, more accurate optimization results, and more competitiveness in challenging problems with unknown search space, compared with well-known algorithms in the literature. The proposal of GMO algorithm enriches the team of swarm intelligence optimization algorithms and also provides a new solution for solving engineering design problems and inverse kinematics of robots.
Collapse
Affiliation(s)
- Honggang Wu
- School of Mechanical and Electrical Engineering, Changchun University of Science and Technology, Changchun 130022, China
| | - Xinming Zhang
- School of Mechanical and Electrical Engineering, Changchun University of Science and Technology, Changchun 130022, China
- School of Mechatronic Engineering and Automation, Foshan University, Foshan 528225, China
| | - Linsen Song
- School of Mechanical and Electrical Engineering, Changchun University of Science and Technology, Changchun 130022, China
| | - Yufei Zhang
- School of Computer Science and Technology, Changchun University of Science and Technology, Changchun 130022, China
| | - Lidong Gu
- School of Mechanical and Electrical Engineering, Changchun University of Science and Technology, Changchun 130022, China
| | - Xiaonan Zhao
- School of Computer Science and Technology, Changchun University of Science and Technology, Changchun 130022, China
| |
Collapse
|
5
|
Sadeghi H, Ajoudanian S. Optimized Feature Selection in Software Product Lines using Discrete Bat Algorithm. INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE AND APPLICATIONS 2022. [DOI: 10.1142/s1469026822500031] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/18/2022]
Abstract
Software Product Lines (SPLs) are one of the ways to develop software products by increasing productivity and reducing cost and time in the software development process. In SPLs, each product has many features and it is necessary to consider the optimal and custom features of the products. In fact, selecting key features in SPLs is a challenging process. Feature selection in SPLs is an optimization problem and an NP-Hard problem. One way to select a feature is to use meta-heuristic algorithms modeled on nature, i.e., Bat Algorithm. By modeling bat behavior in prey hunting, a suitable meta-innovative algorithm is considered. This algorithm has important advantages that make it more accurate than conventional methods such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) algorithm. In this paper, to select software product features, idol binary algorithm and artificial neural network are used to identify important features of software products that reduce production costs and time. The experiments in MATLAB software and datasets related to software production lines show that the rate of reduction of target performance error or feature selection cost in software production lines in the proposed method has decreased by 64.17% with increasing population.
Collapse
Affiliation(s)
- Hajar Sadeghi
- Department of Computer Engineering, Najafabad Branch, Islamic Azad University, Najafabad, Iran
| | - Shohreh Ajoudanian
- Department of Computer Engineering, Najafabad Branch, Islamic Azad University, Najafabad, Iran
- Big Data Research Center, Najafabad Branch, Islamic Azad University, Najafabad, Iran
| |
Collapse
|
7
|
Sun Y, Chen Y. Multi-population improved whale optimization algorithm for high dimensional optimization. Appl Soft Comput 2021. [DOI: 10.1016/j.asoc.2021.107854] [Citation(s) in RCA: 5] [Impact Index Per Article: 1.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 01/23/2023]
|