Locating multiple optima using particle swarm optimization. (English) Zbl 1122.65358

Summary: Many scientific and engineering applications require optimization methods to find more than one solution to multi-modal optimization problems. This paper presents a new particle swarm optimization (PSO) technique to locate and refine multiple solutions to such problems. The technique, NichePSO, extends the inherent unimodal nature of the standard PSO approach by growing multiple swarms from an initial particle population. Each subswarm represents a different solution or niche; optimized individually. The outcome of the NichePSO algorithm is a set of particle swarms, each representing a unique solution.
Experimental results are provided to show that NichePSO can successfully locate all optima on a small set of test functions. These results are compared with another PSO niching algorithm, lbest PSO, and two genetic algorithm niching approaches. The influence of control parameters is investigated, including the relationship between the swarm size and the number of solutions (niches). An initial scalability study is also done.


65K05 Numerical mathematical programming methods
90C15 Stochastic programming
90C29 Multi-objective and goal programming


Full Text: DOI


[1] Bäck, T.; Foge, D. B.; Michalewicz, A., Handbook of Evolutionary Computation (1997), IOP Publishers and Oxford University Press
[2] Beasley, D.; Bull, D. R.; Martin, R. R., A sequential niching technique for multimodal function optimization, Evolutionary Computation, 1, 2, 101-125 (1993)
[3] Bishop, C. M., Neural Networks for Pattern Recognition (1995), Oxford University Press
[6] Clerc, M.; Kennedy, J., The particle swarm – explosion, stability and convergence in a multidimensional complex space, IEEE Transactions on Evolutionary Computation, 6, 1, 58-73 (2002), February
[9] Coello Coello, C. A.; van Veldhuizen, D. A.; Lamont, G. B., Evolutionary Algorithms for Solving Multi-objective Problems (2003), Kluwer Academic Publishers · Zbl 1130.90002
[12] Dorigo, M.; Stützle, T., Ant Colony Optimization (2004), MIT Press · Zbl 1092.90066
[13] Engelbrecht, A. P., Fundamentals of Computational Swarm Intelligence (2005), John Wiley & Sons
[16] (Fiesler, E.; Beale, R., Handbook of Neural Computation (1996), IOP Publishers and Oxford University Press) · Zbl 0888.68099
[23] Kennedy, J.; Eberhart, R. C., Swarm Intelligence (2001), Morgan Kaufman
[31] Parsopoulos, K. E.; Vrahatis, M. N., Modification of the particle swarm optimizer for locating all the global minima, (Kurkova, V.; Steele, N. C.; Neruda, R.; Karny, M., Artificial Neural Networks and Genetic Algorithms (2001), Springer), 324-327 · Zbl 1011.68103
[33] Press, W. H.; Teukolsky, S. A.; Vetterling, W. T.; Flannery, B. P., Numerical Recipes in C: The Art of Scientific Computing (1992), Cambridge University Press · Zbl 0845.65001
[39] van den Bergh, F.; Engelbrecht, A. P., Cooperative learning in neural networks using particle swarm optimizers, South African Computer Journal, 26, 84-90 (2000), November
[41] van den Bergh, F.; Engelbrecht, A. P., A study of particle swarm optimization particle trajectories, Information Science, 176, 8, 937-971 (2006) · Zbl 1093.68105
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.