Modified Local Neighborhood Based Niching Particle Swarm Optimization for Multimodal Function Optimization
A particle swarm optimization model for tracking multiple peaks over a multimodal fitness landscape is described here. Multimodal optimization amounts to finding multiple global and local optima (as opposed to a single solution) of a function, so that the user can have a better knowledge about different optimal solutions in the search space. Niching algorithms have the ability to locate and maintain more than one solution to a multi-modal optimization problem. The Particle Swarm Optimization (PSO) has remained an attractive alternative for solving complex and difficult optimization problems since its advent in 1995. However, both experiments and analysis show that the basic PSO algorithms cannot identify different optima, either global or local, and thus are not appropriate for multimodal optimization problems that require the location of multiple optima. In this paper a niching algorithm named as Modified Local Neighborhood Based Niching Particle Swarm Optimization (ML-NichePSO)is proposed. The ability, efficiency and usefulness of the proposed method to identify multiple optima are demonstrated using well-known numerical benchmarks.
KeywordsEvolutionary computation Swarm Intelligence Multimodal optimization Niching algorithms Particle Swarm Optimization Crowding
Unable to display preview. Download preview PDF.
- 1.Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proc. IEEE Conf. Neural Networks IV, Piscataway, NJ (1995)Google Scholar
- 3.Goldberg, D.E., Richardson, J.: Genetic algorithms with sharing for multimodal function optimization. In: Proceedings of the Second International Conference on Genetic Algorithms, pp. 41–49 (1987)Google Scholar
- 4.Thomsen, R.: Multimodal optimization using Crowding-based differential evolution. In: Proceedings of the IEEE 2004 Congress on Evolutionary Computation, pp. 1382–1389 (2004)Google Scholar
- 5.Harik, G.R.: Finding multimodal solutions using restricted tournament selection. In: Proceedings of the 6th International Conference on Genetic Algorithms, San Francisco, pp. 24–31 (1995)Google Scholar
- 6.Petrowski, A.: A clearing procedure as a niching method for genetic algorithms. In: Proc. of 3rd IEEE Congress on Evolutionary Computation, pp. 798–803 (1996)Google Scholar
- 7.De Jong, K.A.: An analysis of the behavior of a class of genetic adaptive systems, Doctoral Dissertation, University of Michigan (1975)Google Scholar
- 8.Kennedy, J.: Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance. In: Proc. of IEEE Congress on Evolutionary Computation (CEC 1999), Piscataway, NJ, pp. 1931–1938 (1999)Google Scholar
- 9.Li, X.: Multimodal function optimization based on fitness-euclidean distance ratio. In: Proc. Genet. Evol. Comput. Conf., pp. 78–85 (2007)Google Scholar
- 11.Li, X.: Niching without niching parameters: particle swarm optimization using a ring topology. IEEE Transaction on Evolutionary Computation 14(1) (February 2010)Google Scholar
- 12.Qu, B.Y., Suganthan, P.N.: Novel multimodal problems and differential evolution with ensemble of restricted tournament selection. In: IEEE Congress on Evolutionary Computation, Barcelona, Spain (July 2010)Google Scholar
- 13.Qu, B.Y., Suganthan, P.N., Liang, J.J.: Differential Evolution with Neighborhood Mutation for Multimodal Optimization. IEEE Trans. on Evolutionary Computation, doi:10.1109/TEVC.2011.2161873Google Scholar