Related Experiment Video
Updated: Jul 11, 2025

Barnes Maze Testing Strategies with Small and Large Rodent Models
Published on: February 26, 2014
Research on multi-strategy improved sparrow search optimization algorithm
Teng Fei1, Hongjun Wang1, Lanxue Liu1
1Institute of Information Engineering, Tianjin University of Commerce, Tianjin, China.
Abstract:
To address the issues with inadequate search space, sluggish convergence and easy fall into local optimality during iteration of the sparrow search algorithm (SSA), a multi-strategy improved sparrow search algorithm (ISSA), is developed. First, the population dynamic adjustment strategy is carried out to restrict the amount of sparrow population discoverers and joiners. Second, the update strategy in the mining phase of the honeypot optimization algorithm (HBA) is combined to change the update formula of the joiner's position to enhance the global exploration ability of the algorithm. Finally, the optimal position of population discoverers is perturbed using the perturbation operator and levy flight strategy to improve the ability of the algorithm to jump out of local optimum. The experimental simulations are put up against the basic sparrow search algorithm and the other four swarm intelligence (SI) algorithms in 13 benchmark test functions, and the Wilcoxon rank sum test is used to determine whether the algorithm is significantly different from the other algorithms. The results show that the improved sparrow search algorithm has better convergence and solution accuracy, and the global optimization ability is greatly improved. When the proposed algorithm is used in pilot optimization in channel estimation, the bit error rate is greatly improved, which shows the superiority of the proposed algorithm in engineering application.
Related Concept Videos
Conservation of Declining Populations
Multiple Comparison Tests
It would be easy to compare two samples using a significance alpha level of 0.05. In other words, there is only one sample pair to be compared. However, it would be difficult to identify a significantly different sample if the number...
Cluster Sampling Method
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
Heuristics
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...
Trial and Error and Algorithm
Stratified Sampling Method
To choose a stratified sample, divide the population into groups called strata and then take a...

