By Topic

Improving Learning Automata based Particle Swarm: An optimization algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hasanzadeh, M. ; Comput. Eng. & Inf. Technol. Dept., Amirkabir Univ. of Technol., Tehran, Iran ; Meybodi, M.R. ; Ghidary, S.S.

Numerous variations of Particle Swarm Optimization (PSO) algorithms have been recently developed, with the best aim of escaping from local minima. One of these recent variations is PSO-LA model which employs a Learning Automata (LA) that controls the velocity of the particle. Another variation of PSO enables particles to dynamically search through global and local space. This paper presents a Dynamic Global and Local Combined Particle Swarm Optimization based on a 3-action Learning Automata (DPSOLA). The embedded learning automaton accumulates the information from individuals, local best and global best particles then combines them to navigate the particle through the problem space. The proposed algorithm has been tested on eight benchmark functions with different dimensions. The work is unique from its test bed; evaluations contain large population size (150) and high dimension (150). The results show that, fitness and convergence pace is better than traditional PSO, DGLCPSO and previous PSO based LA algorithms.

Published in:

Computational Intelligence and Informatics (CINTI), 2011 IEEE 12th International Symposium on

Date of Conference:

21-22 Nov. 2011