Search

Swarm intelligence optimization algorithm has been proved to perform well in the field of parameter optimization. In order to further improve the performance of intelligent optimization algorithm, this paper proposes an improved and adaptive tunicate swarm algorithm (IMATSA) based on tunicate swarm algorithm (TSA). IMATSA improves TSA in the following four aspects: population diversity, local search convergence speed, jumping out of local optimal position, and balancing global and local search. Firstly, IMATSA adopts Tent map and quadratic interpolation to initialize population and enhance the diversity. Secondly, IMATSA uses Golden-Sine algorithm to accelerate the convergence of local search. Thirdly, in the process of global development, IMATSA adopts Levy flight and the improved Gauss disturbance method to adaptively improves and coordinates the ability of global development and local search. Then, this paper verifies the performance of IMATSA based on 14 benchmark functions experiment, ablation experiment, parameter optimization experiments of Support Vector Machine (SVM) and Gradient Boosting Decision Tree (GBDT), Wilcoxon signed rank test and image multi-threshold segmentation experiment with the performance metrics are convergence speed, convergence value, significance level P-value, Peak Signal-to-Noise Ratio (PSNR) and Standard Deviation (STD). Experimental results show that IMATSA performs better in three kinds of benchmark functions; each component of IMATSA has a positive effect on the performance; IMATSA performs better in parameter optimization experiments of SVM experiment and GBDT; there is significant difference between IMATSA and other algorithms by Wilcoxon signed rank test; in image segmentation, the performance is directly proportional to the number of thresholds, and compared with other algorithms, IMATSA has better comprehensive performance. [ABSTRACT FROM AUTHOR]

Summary: Recently, a new intelligent algorithm called animal migration optimization (AMO) is proposed. The AMO algorithm, which is inspired by the behavior of animal migration, exhibits good performance on a series of benchmark functions whose dimensionality is less than or equal to 30. However, its performance deteriorates evidently when the dimensionality is more than 30. To overcome this drawback, we proposed an improved AMO (IAMO) with interactive learning mechanism in this article. First, an interactive learning mechanism is designed to improve the intelligence of AMO. During the the search process, individuals learn from each other by the exchange of information, and the search mode is adjusted dynamically. Second, a refined search method is adopted to enhance the search ability of AMO. Individuals will search around the current solutions in order to improve the quality of solutions. Third, a birth‐and‐death strategy is introduced to avoid local optimum. In addition, the property convergence of IAMO is analyzed theoretically. The proposed algorithm is validated on several standard benchmark functions whose dimensionality is 50, 100, and 150, respectively. The empirical results demonstrate that the performance of our proposed algorithm is promising. [ABSTRACT FROM AUTHOR]