Dynamic Particle Swarm Optimization for Multimodal Function

Abstrak

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