Movement Particle Swarm Optimization Algorithm

Amjad A. Hudaib and Ahmad AL Hwaitat

Modern Applied Science, 2018, vol. 12, issue 1, 148

Abstract: Particle Swarm Optimization (PSO) is a well known meta-heuristic that has been used in many applications for solving optimization problems. But it has some problems such as local minima. In this paper proposed an optimization algorithm called Movement Particle Swarm Optimization (MPSO) that enhances the behavior of PSO by using a random movement function to search for more points in the search space. The meta-heuristic has been experimented over 23 benchmark faction compared with state of the art algorithms- Multi-Verse Optimizer (MFO), Sine Cosine Algorithm (SCA), Grey Wolf Optimizer (GWO) and particle Swarm Optimization (PSO). The Results showed that the proposed algorithm has enhanced the PSO over the tested benchmarked functions.

Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
https://ccsenet.org/journal/index.php/mas/article/download/72356/39890 (application/pdf)
https://ccsenet.org/journal/index.php/mas/article/view/72356 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ibn:masjnl:v:12:y:2017:i:1:p:148

Access Statistics for this article

More articles in Modern Applied Science from Canadian Center of Science and Education Contact information at EDIRC.
Bibliographic data for series maintained by Canadian Center of Science and Education ().