An improved artificial fish swarm algorithm optimized by particle swarm optimization algorithm with extended memory

The purpose of this paper is to solve the problem that the standard particle swarm optimization (PSO) algorithm has a low success rate when applied to the optimization of multi-dimensional and multi-extreme value functions, the authors would introduce the extended memory factor to the PSO algorithm. Furthermore, the paper aims to improve the convergence rate and precision of basic artificial fish swarm algorithm (FSA), a novel FSA optimized by PSO algorithm with extended memory (PSOEM-FSA) is proposed.

In PSOEM-FSA, the extended memory for PSO is introduced to store each particle’ historical information comprising of recent places, personal best positions and global best positions, and a parameter called extended memory effective factor is employed to describe the importance of extended memory. Then, stability region of its deterministic version in a dynamic environment is analyzed by means of the classic discrete control theory. Furthermore, the extended memory factor is applied to five kinds of behavior pattern for FSA, including swarming, following, remembering, communicating and searching.

The paper proposes a new intelligent algorithm. On the one hand, this algorithm makes the fish swimming have the characteristics of the speed of inertia; on the other hand, it expands behavior patterns for the fish to choose in the search process and achieves higher accuracy and convergence rate than PSO-FSA, owning to extended memory beneficial to direction and purpose during search. Simulation results verify that these improvements can reduce the blindness of fish search process, improve optimization performance of the algorithm.

Because of the chosen research approach, the research results may lack persuasion. In the future study, the authors will conduct more experiments to understand the behavior of PSOEM-FSA. In addition, there are mainly two aspects that the performance of this algorithm could be further improved.

The proposed algorithm can be used to many practical engineering problems such as tracking problems.

The authors hope that the PSOEM-FSA can increase a branch of FSA algorithm, and enrich the content of the intelligent algorithms to some extent.

The novel optimized FSA algorithm proposed in this paper improves the convergence speed and searching precision of the ordinary FSA to some degree.