CIVILICA We Respect the Science
(ناشر تخصصی کنفرانسهای کشور / شماره مجوز انتشارات از وزارت فرهنگ و ارشاد اسلامی: ۸۹۷۱)

A greedy cluster-based tribes optimization algorithm

عنوان مقاله: A greedy cluster-based tribes optimization algorithm
شناسه ملی مقاله: IINC02_016
منتشر شده در دومین کنفرانس بین المللی شبکه های اطلاعاتی هوشمند و سیستم های پیچیده در سال 1393
مشخصات نویسندگان مقاله:

Neda Bagherzadeh - Engineering department, IAUM Mashhad, Iran
Mahdi Heidari - Engineering department, IAUM Mashhad, Iran
Mohammad-R Akbarzadeh-T - Faculty of engineering, FUM Mashhad, Iran

خلاصه مقاله:
In this paper, we propose a cluster-based optimization algorithm. It is a greedy agent-based tribal particle swarm optimization algorithm (GATPSO) which adapts the tribes byremoving/generating particles and reconstructing tribal links in order to encourage better tribes to proliferate, and causesreducing the computation cost and preventing local optimal solutions. The proposed approach is applied to several numeric benchmarks. Results of this study demonstrate the effectiveness of the proposed algorithm.

صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/344790/