A Novel Student Psychological Based Optimization Algorithm with Multiple Strategies
To tackle the low convergence accuracy and vulner-ability to local optima problems of the SPBO algorithm, a novel student psychology based optimization (NSPBO) algorithm is introduced, integrating different enhancement strategies. Firstly, a wavelet mutation strategy is implemented to improve the guiding function of the optimal individual in the algorithm's search process, thus enhancing the algorithm's local optimization capability. Secondly, a weighted center and Cauchy mutation mechanism are integrated into the randomly enhanced student individuals to maintain diversity among student individuals and avoid the algorithm from getting stuck in local optima prematurely. Finally, a region-based learning search strategy is applied to the entire population to boost the algorithm's search accuracy and expedite the search process. Experimental tests were conducted on eighteen standard test functions to compare the performance of the proposed algorithm with other intelligent optimization algorithms. The findings indicate that the proposed algorithm exhibits exceptional optimization performance, excelling in both accuracy and convergence speed.
Authors
- Qiuyan Xu (ORCID: https://orcid.org/0000-0003-0130-7103)
- Liwei Zhang (ORCID: https://orcid.org/0000-0003-0080-6402)
- Fei Zhang (ORCID: https://orcid.org/0000-0002-4488-8692)
- Wenting Ji
Publication Details
- Published
- 2024-08-16
- DOI
- https://doi.org/10.1109/docs63458.2024.10704400
- Primary Topic
- Teaching and Learning Programming
- Type
- article
- Field-Weighted Citation Impact
- 0.00