کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5475907 | 1521422 | 2017 | 15 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An effective Lightning Flash Algorithm solution to large scale non-convex economic dispatch with valve-point and multiple fuel options on generation units
ترجمه فارسی عنوان
راه حل الگوریتم رعد و برق فلش برای مقیاس بزرگ غیر رسمی اعزام اقتصادی با دریچه نقطه و گزینه های مختلف سوخت در واحدهای تولید
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
تولید برق، گزینه سوخت چندگانه، اثرات دریچه نقطه، اعزام اقتصادی، بهینه سازی،
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی انرژی
انرژی (عمومی)
چکیده انگلیسی
Generation units with multiple fuel options and valve-point loading effects on the generators are fundamental parts of power system generation. However, economic dispatch (ED) of these units have non-convex, non-continuous generation cost functions. In this paper, a new Lightning Flash Algorithm (LFA) is proposed to solve complex non-convex ED problems in large scale power systems considering multiple fuel options and valve point effects on the generators. Five case study systems including 10-units, 40-units, 80-units, 160-units and 640-units are conducted to validate the applicability and effectiveness of the proposed LFA method for solving ED problems. The results are compared with other published methods in literature and confirm the applicability and effectiveness of LFA against other existing methods. LFA can successfully conduct the best fuel types of the generators and adjust the optimum settings to allocate load demand to the online generation units in power system. The results demonstrate that using proposed LFA method can minimize the total generation costs and optimally satisfy the load demands in the power grid.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Energy - Volume 129, 15 June 2017, Pages 1-15
Journal: Energy - Volume 129, 15 June 2017, Pages 1-15
نویسندگان
Mostafa Kheshti, Xiaoning Kang, Zhaohong Bie, Zaibin Jiao, Xiuli Wang,