An Intelligent Approach Based on Meta-Heuristic Algorithm for Non-Convex Economic Dispatch

Author(s):
Message:
Abstract:
One of the significant strategies of the power systems is Economic Dispatch (ED) problem, which is defined as the optimal generation of power units to produce energy at the lowest cost by fulfilling the demand within several limits. The undeniable impacts of ramp rate limits, valve loading, prohibited operating zone, spinning reserve and multi-fuel option on the economic dispatch of practical power systems are scrutinized in this paper. Thus, the proposed nonlinear non-convex formulation is solved by a new modified version of bio-inspired bat algorithm. Due to the complexities associated with the large-scale optimization problem of economic dispatch, adaptive modifications are added to the original bat algorithm. The modification methods are applied at two separate stages and pledge augmentation in convergence rate of the algorithm as well as extricating the algorithm from local optima. Veracity of the proposed methodology are corroborated by performing simulations on three IEEE test systems.
Language:
English
Published:
Journal of Operation and Automation in Power Engineering, Volume:3 Issue: 1, Winter - Spring 2015
Pages:
47 to 55
magiran.com/p1419762  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!