Quasi-oppositional symbiotic organisms search algorithm for different economic load dispatch problems

Message:
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:

In this paper, an effective meta-heuristic technique called Quasi-Oppositional Symbiotic Organisms Search is applied for solving non-convex economic dispatch problems. Symbiotic Organisms Search is a soft computing technique, inspired by organisms in the ecosystem. This technique is implemented for improving the solution quality in minimum time. In order to improve convergence rate, quasi-reflected numbers are used here instead of pseudo-random numbers. Different equality and inequality constraints such as transmission loss, load demand, prohibited operating zone, generator operating limits and boundary of ramp rate are considered here. Presence of multiple fuels and valve point are also considered in some cases. This algorithm is applied to four different test systems. Simulation results are compared with many recently developed optimization techniques to show the superiority and consistency of this method. Simulation results also show that the computational efficiency of this algorithm is much better than the other meta-heuristic methods available in the literature.

Language:
English
Published:
Pages:
3096 to 3117
magiran.com/p2213831  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!