Dynamic Particle Swarm Optimization for Multimodal Function

H. Omranpour, M. Ebadzadeh, S. Shiry, S. Barzegar


In this paper, a technical approach to particle swarm optimization method is presented. The main idea of the paper is based on local extremum escape. A new definition has been called the worst position. With this definition, convergence and trapping in extremumlocal be prevented and more space will be searched. In many cases of optimization problems, we do not know the range that answer is that.In the results of examine on the benchmark functions have been observed that when initialization is not in the range of the answer, the other known methods are trapped in local extremum. The method presented is capable of running through it and the results have been achieved with higher accuracy.

DOI: http://dx.doi.org/10.11591/ij-ai.v1i1.367


Optimization, Swarm intelligence, Particle swarm optimization, Local extremum, Search space the initial distribution

Full Text:



  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

IAES International Journal of Artificial Intelligence (IJ-AI)
ISSN/e-ISSN 2089-4872/2252-8938 
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).

View IJAI Stats