Solving the Economic Load Dispatch Problem Considering Units with Different Fuels Using Evolutionary Algorithms

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

Nowadays, economic load dispatch between generation units with least cost involved is one of the most important issues in utilizing power systems. In this paper, a new method i.e. Water Cycle Algorithm (WCA) which is similar to other intelligent algorithm and is based on swarm, is employed in order to solve the economic load dispatch problem between power plants. In order to investigate the effectiveness of the proposed method in solving non-linear cost functions which is composed of the constraint for input steam valve and units with different fuels, a system with 10 units is studied for more accordance with literatures in two modes: one without considering the effect of steam valve and load of 2400, 2500, 2600 and 2700 MW and the other one with considering the effect of steam valve and load of 2700 MW. The results of the paper comparing to the results of the other valid papers show that the proposed algorithm can be used to solve in any kind of economic dispatch problems with proper results.

Language:
English
Published:
International Journal of Smart Electrical Engineering, Volume:2 Issue: 4, Autumn 2013
Pages:
201 to 208
magiran.com/p2258856  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!