EMPSACO: AN IMPROVED HYBRID OPTIMIZATION ALGORITHM BASED ON PARTICLE SWARM, ANT COLONY AND ELITIST MUTATION ALGORITHMS

Message:
Abstract:
This research presents an efficient and reliable swarm intelligence-based approach, ant colony optimization and elitist-mutated particle swarm optimization. Methods of particle swarm optimization (PSO) and ant colony optimization (ACO) and elitist mutation particle swarm optimization (EMPSO) are co-operative, population-based global search swarm intelligence metaheuristics. PSO is inspired by social behavior of bird flocking or fish schooling, while ACO imitates foraging behavior of real life ants and Elitist mutation taken from genetic mutation from genetic algorithm techniques. In this study, we explore a simple approach to improve the performance of the PSO method for optimization of multimodal continuous functions. The proposed EMPSACO algorithm is tested on several test functions from the usual literature and compared with PSO, PSACO and GA (Genetic Algorithm). Results showed that the effectiveness and efficiency of the proposed EMPSACO method had suitable accuracy to optimize multimodal functions.
Language:
English
Published:
Iranian Journal of Science and Technology Transactions of Civil Engineering, Volume:37 Issue: 2, 2013
Pages:
491 to 501
magiran.com/p1215939  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!