Utilizing Particle Swarm Optimization into Multimodal Function Optimization

There are some modified methods such as K-means Clustering Particle Swarm Optimization and Niching Particle Swarm Optimization based on PSO which aim to locate all optima in multi modal functions. K-means Clustering Particle Optimization could locate all optima of functions with finite number of optima. Niching Particle Swarm Optimization is able to locate all of optima but high computing time. Because of those disadvantages, we proposed a new method that could locate all of optima with reasonal time. We applied our method and others as well to analytic functions. By comparing the outcomes, it is shown that our method is significantly more effective than the two others.