An improved particle swarm optimisation based on cellular automata
by Yuntao Dai; Liqiang Liu; Ying Li; Jingyi Song
International Journal of Computing Science and Mathematics (IJCSM), Vol. 5, No. 1, 2014

Abstract: Particle swarm optimisation (PSO) algorithm is easy to fall into local optimum, so an improved PSO based on cellular automata is proposed by combining cellular automata (CA) with PSO. In the proposed CAPSO, each particle of particle swarm is considered as cellular automata, and is distributed in two-dimensional grid. The state update of each cell is not only related to its own state and the neighbour state, but also related with the state of the optimal cell. If the state is too close with the optimal cell, then the cell state is re-update. Simulation experiments on typical test functions show that, compared with other algorithms, the proposed algorithm has good robustness, strong local search ability and global optimisation ability, and can solve the optimisation problems effectively.

Online publication date: Mon, 30-Jun-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com