Thursday, 21 April 2022

Markov Chain and Adaptive Parameter Selection on Particle Swarm Optimizer

Chao-Wei Chou, Jiann-Horng Lin and Rong Jeng,I-Shou University,Taiwan

ABSTRACT

Particle Swarm Optimizer (PSO) is such a complex stochastic process so that analysis on the stochastic behavior of the PSO is not easy. The choosing of parameters plays an important role since it is critical in the performance of PSO. As far as our investigation is concerned, most of the relevant researches are based on computer simulations and few of them are based on theoretical approach. In this paper, theoretical approach is used to investigate the behavior of PSO. Firstly, a state of PSO is defined in this paper, which contains all the information needed for the future evolution. Then the memory-less property of the state defined in this paper is investigated and proved. Secondly, by using the concept of the state and suitably dividing the whole process of PSO into countable number of stages (levels), a stationary Markov chain is established. Finally, according to the property of a stationary Markov chain, an adaptive method for parameter selection is proposed.

KEYWORDS

Markov chain, Memory-less property, Order Statistics, Particle Swarm Optimizer, Percentile, Stationary Markov chain

Original Source URL: https://airccse.org/journal/ijsc/papers/4213ijsc01.pdf

https://airccse.org/journal/ijsc/current2013.html



No comments:

Post a Comment

February Issue Journal! Authors are invited to submit papers!

International Journal on Soft Computing (IJSC) ISSN: 2229 - 6735 [Online]; 2229 - 7103 [Print] https://airccse.org/journal/ijsc/ijsc.html He...