Improved Group Search Optimization Algorithm for Multi-Objective Optimal Reactive Power Dispatch

Abstract:
This paper proposes the improved group search optimization algorithm for optimal reactive power dispatch (ORPD). The ORPD problem is a non-linear, non-convex optimization problem which has various decision variables such as the compensation capacitors proportions, voltages of generators and the tap position of tap changing transformers. In this paper the multi-objective ORPD considering loss and voltage deviation is studied. Due to complicating objectives and also physical and operating constraints, an efficient optimization algorithm is needed. This paper solves the mentioned problem by using the group search optimization algorithm (GSO) which is one of the novel presented optimization algorithms based on group living and especially searching behavior of animals. In order to improve the algorithm efficiencies, the improved group search optimization algorithm (IGSO) is proposed. Accordingly, the algorithm would obtain better result due to its ability to find the global optimal rather than local ones. Additionally, the penalty factor approach is used in order to solve the multi-objective case.
Language:
English
Published:
Majlesi Journal of Electrical Engineering, Volume:10 Issue: 4, Dec 2016
Page:
1
magiran.com/p1630674  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!