سال انتشار: ۱۳۸۳

محل انتشار: ششمین کنفرانس سراسری سیستم های هوشمند

تعداد صفحات: ۱۵

نویسنده(ها):

r Rastegar – Soft Computing Lab1 Computer Engineering Department Amirkabir University, Tehran, Iran
m.r Meybodi –
k Badie – Information Group2 Iran Telecommunication Research Center Tehran, Iran

چکیده:

The particle swarm is one of the most powerful methods for solving global optimization problems. This method is an adaptive algorithm based on social-psychological metaphor. A population of particle adapts by returning stochastically toward previously successful regions in the search space and is influenced by the successes of their topological neighbors. In this paper we propose a learning automata based discrete binary particle swarm algorithm. In the proposedalgorithm the set of learning automata assigned to a particle may be viewed as the brain of the particle determining its position from its own and other particles past experience. The numerical results show that the performance of the proposed algorithm is better than Kennedy’s approach for some of test bed problems