13 results on '"Cai, Zhennao"'
Search Results
2. Dimensional decision covariance colony predation algorithm: global optimization and high−dimensional feature selection
- Author
-
Xu, Boyang, Heidari, Ali Asghar, Cai, Zhennao, and Chen, Huiling
- Published
- 2023
- Full Text
- View/download PDF
3. Multi-strategies Boosted Mutative Crow Search Algorithm for Global Tasks: Cases of Continuous and Discrete Optimization
- Author
-
Shan, Weifeng, Hu, Hanyu, Cai, Zhennao, Chen, Huiling, Liu, Haijun, Wang, Maofa, and Teng, Yuntian
- Published
- 2022
- Full Text
- View/download PDF
4. A multi-strategy enhanced salp swarm algorithm for global optimization
- Author
-
Zhang, Hongliang, Cai, Zhennao, Ye, Xiaojia, Wang, Mingjing, Kuang, Fangjun, Chen, Huiling, Li, Chengye, and Li, Yuping
- Published
- 2022
- Full Text
- View/download PDF
5. Environment random interaction of rime optimization with Nelder-Mead simplex for parameter estimation of photovoltaic models.
- Author
-
Shi, Jinge, Chen, Yi, Heidari, Ali Asghar, Cai, Zhennao, Chen, Huiling, Chen, Yipeng, and Liang, Guoxi
- Abstract
As countries attach importance to environmental protection, clean energy has become a hot topic. Among them, solar energy, as one of the efficient and easily accessible clean energy sources, has received widespread attention. An essential component in converting solar energy into electricity are solar cells. However, a major optimization difficulty remains in precisely and effectively calculating the parameters of photovoltaic (PV) models. In this regard, this study introduces an improved rime optimization algorithm (RIME), namely ERINMRIME, which integrates the Nelder-Mead simplex (NMs) with the environment random interaction (ERI) strategy. In the later phases of ERINMRIME, the ERI strategy serves as a complementary mechanism for augmenting the solution space exploration ability of the agent. By facilitating external interactions, this method improves the algorithm’s efficacy in conducting a global search by keeping it from becoming stuck in local optima. Moreover, by incorporating NMs, ERINMRIME enhances its ability to do local searches, leading to improved space exploration. To evaluate ERINMRIME's optimization performance on PV models, this study conducted experiments on four different models: the single diode model (SDM), the double diode model (DDM), the three-diode model (TDM), and the photovoltaic (PV) module model. The experimental results show that ERINMRIME reduces root mean square error for SDM, DDM, TDM, and PV module models by 46.23%, 59.32%, 61.49%, and 23.95%, respectively, compared with the original RIME. Furthermore, this study compared ERINMRIME with nine improved classical algorithms. The results show that ERINMRIME is a remarkable competitor. Ultimately, this study evaluated the performance of ERINMRIME across three distinct commercial PV models, while considering varying irradiation and temperature conditions. The performance of ERINMRIME is superior to existing similar algorithms in different irradiation and temperature conditions. Therefore, ERINMRIME is an algorithm with great potential in identifying and recognizing unknown parameters of PV models. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
6. Boosted Sine Cosine Algorithm with Application to Medical Diagnosis.
- Author
-
Ye, Xiaojia, Cai, Zhennao, Lu, Chenglang, Chen, Huiling, and Pan, Zhifang
- Subjects
- *
COSINE function , *DIAGNOSIS , *PARTICLE swarm optimization , *GLOBAL optimization , *SUPPORT vector machines , *ALGORITHMS - Abstract
The sine cosine algorithm (SCA) was proposed for solving optimization tasks, of which the way to obtain the optimal solution is mainly through the continuous iteration of the sine and cosine update formulas. However, SCA also faces low population diversity and stagnation of locally optimal solutions. Hence, we try to eliminate these problems by proposing an enhanced version of SCA, named ESCA_PSO. ESCA_PSO is proposed based on hybrid SCA and particle swarm optimization (PSO) by incorporating multiple mutation strategies into the original SCA_PSO. To validate the effect of ESCA_PSO in handling global optimization problems, ESCA_PSO was compared with quality algorithms on various types of benchmark functions. In addition, the proposed ESCA_PSO was employed to tune the best parameters of support vector machines for dealing with medical diagnosis tasks. The results prove the efficiency of the proposed algorithms in solving optimization problems. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
7. OCRUN: An oppositional Runge Kutta optimizer with cuckoo search for global optimization and feature selection.
- Author
-
Zhang, Meilin, Chen, Huiling, Heidari, Ali Asghar, Cai, Zhennao, Aljehane, Nojood O., and Mansour, Romany F.
- Subjects
GLOBAL optimization ,SWARM intelligence ,CUCKOOS ,FEATURE selection ,WILCOXON signed-rank test ,ENGINEERING design ,RUNGE-Kutta formulas - Abstract
The recently proposed swarm intelligence algorithm, Runge–Kutta Optimization (RUN), is rooted in the fourth-order Runge–Kutta method. Compared with its counterparts, RUN boasts an advantage of having a more concrete theoretical foundation embodying a more powerful optimization efficacy, free from any metaphor. However, RUN still has its shortcomings. The compelling enhanced solution function leads to insufficient exploration ability of the algorithm, and resulting in an imbalance between exploration and exploitation that cannot be mitigated. An improved version based on opposition-based learning and cuckoo search is proposed to compensate for the above deficiencies, called OCRUN. OCRUN is tested on 30 test functions of CEC2014 with 10 classical metaheuristics and 9 advanced metaheuristics, respectively. Combining the experimental results and the Wilcoxon signed-rank test, OCRUN exhibits excellent performance. At the same time, parameter sensitivity analysis experiments are also carried out on this test set. Furthermore, a binary implementation of the algorithm was constructed specifically for feature selection cases, labeled as BOCRUN. BOCRUN is compared with 5 existing binary metaheuristics on 15 public datasets. The experimental results show that the improved algorithm performs well in feature selection. Therefore, OCRUN is an effectively improved optimizer. Finally, the OCRUN method offers high-quality solutions to engineering problems and contributes significantly to engineering design under practical constraints. The method has been successfully applied to various design scenarios, such as reducer design, cantilever beam design, and tension/compression spring design. The OCRUN method outperforms other similar products in terms of performance and effectiveness. • Oppositional Runge–Kutta Optimizer with Cuckoo Search (OCRUN) for feature selection • OCRUN introduces Opposition-based Learning (OBL) and Cuckoo Search (CS) strategies. • OBL enhances exploration ability; CS increases population diversity. • OCRUN outperforms other optimizers on 30 CEC2014 functions. • Binary OCRUN excels in classification on 15 UCI datasets. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
8. Random following ant colony optimization: Continuous and binary variants for global optimization and feature selection.
- Author
-
Zhou, Xinsen, Gui, Wenyong, Heidari, Ali Asghar, Cai, Zhennao, Liang, Guoxi, and Chen, Huiling
- Subjects
ANT algorithms ,GLOBAL optimization ,FEATURE selection ,ANT colonies ,WILCOXON signed-rank test ,EVOLUTIONARY computation - Abstract
Continuous ant colony optimization was a population-based heuristic search algorithm inspired by the pathfinding behavior of ant colonies with a simple structure and few control parameters. However, in the case of multimodal and high-dimensional optimization problems, it was often limited to local regions in the feasible domain space, negatively affecting the computational effort required to find the optimal solution point. To alleviate its limitations in this regard, a random following strategy is proposed to enhance communication among the ant colony search agent and other ant colony members within the search dimension. The proposed algorithm that incorporates this strategy is called Random Following Ant Colony Optimization. Then, to evaluate the global optimization performance of the proposed algorithm, the well-known numerical optimization problem, namely the Congress on Evolutionary Computation 2017 test suite, is used. First, the proposed algorithm's parameters are analyzed for sensitivity, scalability experiments, and balanced diversity. Second, it is compared experimentally with 11 state-of-the-art algorithms in dimensions 10, 30, 50, and 100, respectively, and Wilcoxon signed-rank test, Friedman test, and Bonferroni-Dunn post-hoc statistical test are used to synthesize the experimental comparison results. Finally, to evaluate the ability of the proposed algorithm to handle discrete feature selection problems, comparative experiments are conducted on 24 datasets with eight well-known classification methods and five high-performance classification methods. The benchmark test results show that the global optimization performance of the proposed algorithm is comparable to the winners of the test suite in 50 and 100 dimensions. The results of the feature selection experiments show that the proposed algorithm is much stronger than the well-known and high-performance classification methods on high-dimensional datasets. • An ant colony optimization method with random following (RFACO) is proposed. • A new random following strategy is proposed to improve the global search capability. • RFACO obtains higher quality optimal solutions in IEEE CEC2017 functions. • The binary version of RFACO shows excellent classification performance. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
9. Quantum-like mutation-induced dragonfly-inspired optimization approach.
- Author
-
Yu, Caiyang, Cai, Zhennao, Ye, Xiaojia, Wang, Mingjing, Zhao, Xuehua, Liang, Guoxi, Chen, Huiling, and Li, Chengye
- Subjects
- *
QUANTUM gates , *PARTICLE swarm optimization , *ALGORITHMS , *WILCOXON signed-rank test , *FEATURE selection , *BENCHMARK problems (Computer science) , *EVOLUTIONARY computation - Abstract
This study proposed an improved dragonfly algorithm (DA). This algorithm is a recently proposed metaheuristic optimizer inspired by swarming behaviors of dragonflies, which has reasonably achieved satisfactory results in dealing with engineering, education, and other fields. However, the original method will show some shortcomings in convergence speed or falling into local optimum. Given these shortcomings, this paper proposes an improved optimizer to balance the relationship between exploitation and exploration and mitigate any deficiency. First, by implementing the idea of the quantum rotation gate, the swarm of agents can be shifted to a position more conducive to the optimal value. Then, Gaussian mutation is adopted to improve the swarm's ability to mutate and realize its diversity, which enables the primary method to have a strong local search capability. The proposed method was compared against six other common meta-heuristics and five state-of-the-art algorithms on a comprehensive set of nineteen functions selected from twenty-three classic benchmark problems and thirty IEEE (Institute of Electrical and Electronics Engineers) CEC (Congress on Evolutionary Computation) 2014 benchmark tasks. To verify the effectiveness of the approach, the non-parametric statistical Wilcoxon signed-rank and Friedman tests were performed to validate the significance of the proposed method against other counterparts. The results of experimental simulations demonstrate that two introduced strategies can significantly improve the exploitative and exploratory tendencies of the original algorithm. Furthermore, the convergence speed of the conventional approach has been improved to a large extent. Additionally, quantum-behaved and Gaussian mutational dragonfly algorithm (QGDA) is utilized as a searching core in a wrapper feature selection technique, and it is compared with other advanced feature selection methods. The results show that QGDA achieves substantial superiority in feature selection through optimum fitness and minimum error rate. Also, the results of QGDA on the three classical engineering design problems have demonstrated that the proposed method can effectively solve these constraints problems. It is encouraging that the proposed method can be used as a useful, auxiliary tool for solving complex optimization problems. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
10. Enhanced differential evolution algorithm for feature selection in tuberculous pleural effusion clinical characteristics analysis.
- Author
-
Zhou, Xinsen, Chen, Yi, Gui, Wenyong, Heidari, Ali Asghar, Cai, Zhennao, Wang, Mingjing, Chen, Huiling, and Li, Chengye
- Abstract
Tuberculous pleural effusion poses a significant threat to human health due to its potential for severe disease and mortality. Without timely treatment, it may lead to fatal consequences. Therefore, early identification and prompt treatment are crucial for preventing problems such as chronic lung disease, respiratory failure, and death. This study proposes an enhanced differential evolution algorithm based on colony predation and dispersed foraging strategies. A series of experiments conducted on the IEEE CEC 2017 competition dataset validated the global optimization capability of the method. Additionally, a binary version of the algorithm is introduced to assess the algorithm's ability to address feature selection problems. Comprehensive comparisons of the effectiveness of the proposed algorithm with 8 similar algorithms were conducted using public datasets with feature sizes ranging from 10 to 10,000. Experimental results demonstrate that the proposed method is an effective feature selection approach. Furthermore, a predictive model for tuberculous pleural effusion is established by integrating the proposed algorithm with support vector machines. The performance of the proposed model is validated using clinical records collected from 140 tuberculous pleural effusion patients, totaling 10,780 instances. Experimental results indicate that the proposed model can identify key correlated indicators such as pleural effusion adenosine deaminase, temperature, white blood cell count, and pleural effusion color, aiding in the clinical feature analysis of tuberculous pleural effusion and providing early warning for its treatment and prediction. • The CFDE is designed and verified on benchmarks. • The binary version of CFDE (bCFDE) is designed for TBPE. • The bCFDE is verified on 24 datasets and compared to other peers. • The bCFDE-SVM is applied to TBPE successfully. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
11. Gaussian kernel probability-driven slime mould algorithm with new movement mechanism for multi-level image segmentation.
- Author
-
Ren, Lili, Heidari, Ali Asghar, Cai, Zhennao, Shao, Qike, Liang, Guoxi, Chen, Hui-Ling, and Pan, Zhifang
- Subjects
- *
MYXOMYCETES , *IMAGE segmentation , *ALGORITHMS , *SWARM intelligence , *GLOBAL optimization , *MARKOV random fields , *GAUSSIAN processes - Published
- 2022
- Full Text
- View/download PDF
12. Advanced orthogonal moth flame optimization with Broyden–Fletcher–Goldfarb–Shanno algorithm: Framework and real-world problems.
- Author
-
Zhang, Hongliang, Li, Rong, Cai, Zhennao, Gu, Zhiyang, Heidari, Ali Asghar, Wang, Mingjing, Chen, Huiling, and Chen, Mayun
- Subjects
- *
MATHEMATICAL optimization , *GLOBAL optimization , *MOTHS , *ALGORITHMS , *CONSTRAINED optimization , *PARTICLE swarm optimization , *MULTIMODAL user interfaces , *SWARM intelligence - Abstract
• BFGSOLMFO is proposed for global optimization and real-world problems. • OL is used to enhance exploitation and exploration ability of MFO. • BFGS is employed to further excavate the potential global best solution. As a typical emergent swarm intelligence algorithm, Moth-Flame Optimization (MFO) has been created to deal with global optimization problems. Since the introduction, it has been applied to various optimization problems. However, MFO may have the trouble of getting into the local best, and the convergence rate cannot be satisfying when handling the high-dimensional and some multimodal problems. In this work, an enhanced MFO integrated with orthogonal learning (OL) and Broyden-Fletcher-Goldfarb-Shanno (BFGS), which we called BFGSOLMFO, is proposed to alleviate the stagnation shortcomings and accelerate the performance of well-regarded MFO. In the BFGSOLMFO, OL is used to construct a better candidate solution for each moth and then guide the whole population to a reasonable potential area. Meanwhile, in each iteration, after the evolution of population finished and the global optima are obtainable, BFGS is employed to further excavate the potential of the global best moth in the current population. With the aim of evaluating the efficacy of the BFGSOLMFO, first of all, the IEEE CEC2014 benchmark set is utilized to measure the performance in solving function optimizations with high-dimensional and multimodal characteristics. Both sets of the IEEE CEC2011 real-world benchmark problems and the three constrained engineering optimization problems are adopted to estimate the performance of BFGSOLMFO in tackling practical scenarios. In all the experiments, the developed BFGSOLMFO is compared with state-of-the-art advanced algorithms. Experimental results and statistical tests demonstrate that the proposed method outperforms the basic MFO and a comprehensive set of advanced algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
13. Dispersed foraging slime mould algorithm: Continuous and binary variants for global optimization and wrapper-based feature selection.
- Author
-
Hu, Jiao, Gui, Wenyong, Heidari, Ali Asghar, Cai, Zhennao, Liang, Guoxi, Chen, Huiling, and Pan, Zhifang
- Subjects
- *
MYXOMYCETES , *FEATURE selection , *GLOBAL optimization , *WILCOXON signed-rank test , *ALGORITHMS , *SWARM intelligence - Abstract
The slime mould algorithm (SMA) is a logical swarm-based stochastic optimizer that is easy to understand and has a strong optimization capability. However, the SMA is not suitable for solving multimodal and hybrid functions. Therefore, in the present study, to enhance the SMA and maintain population diversity, a dispersed foraging SMA (DFSMA) with a dispersed foraging strategy is proposed. We conducted extensive experiments based on several functions in IEEE CEC2017. The DFSMA were compared with 11 other meta-heuristic algorithms (MAs), 10 advanced algorithms, and 3 recently proposed algorithms. Moreover, to conduct more systematic data analyses, the experimental results were further evaluated using the Wilcoxon signed-rank test. The DFSMA was shown to outperform other optimizers in terms of convergence speed and accuracy. In addition, the binary DFSMA (BDFSMA) was obtained using the transform function. The performance of the BDFSMA was evaluated on 12 datasets in the UCI repository. The experimental results reveal that the BDFSMA performs better than the original SMA, and that, compared with other optimization algorithms, it improves classification accuracy and reduces the number of selected features, demonstrating its practical engineering value in spatial search and feature selection. • An improved slime mould algorithm (DFSMA) is proposed for feature selection. • The performance of DFSMA is verified by comparing with several famous algorithms. • DFSMA has faster convergence speed and accuracy compared with others. • DFSMA has achieved higher classification accuracy and smaller number of features. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.