PSO for multi-objective problems: Criteria for leader selection and uniformity distribution

Author(s):
Abstract:
This paper proposes a method to solve multi-objective problems using improved Particle Swarm Optimization. We propose leader particles which guide other particles inside the problem domain. Two techniques are suggested for selection and deletion of such particles to improve the optimal solutions. The first one is based on the mean of the m optimal particles and the second one is based on appointing a leader particle for any n founded particles. We used an intensity criterion to delete the particles in both techniques. The proposed techniques were evaluated based on three standard tests in multi-objective evolutionary optimization problems. The evaluation criterion in this paper is the number of particles in the optimal-Pareto set, error, and uniformity. The results show that the proposed method searches more number of optimal particles with higher intensity and less error in comparison with basic MOPSO and SIGMA and CMPSO and NSGA-II and microGA and PAES and can be used as proper techniques to solve multi-objective optimization problems.
Language:
English
Published:
Journal of Artificial Intelligence and Data Mining, Volume:4 Issue: 1, Winter-Spring 2016
Pages:
67 to 76
magiran.com/p1538400  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!