کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
387250 | 660897 | 2009 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An improved binary particle swarm optimization for unit commitment problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: An improved binary particle swarm optimization for unit commitment problem An improved binary particle swarm optimization for unit commitment problem](/preview/png/387250.png)
چکیده انگلیسی
This paper proposes a new improved binary PSO (IBPSO) method to solve the unit commitment (UC) problem, which is integrated binary particle swarm optimization (BPSO) with lambda-iteration method. The IBPSO is improved by priority list based on the unit characteristics and heuristic search strategies to repair the spinning reserve and minimum up/down time constraints. To verify the advantages of the IBPSO method, the IBPSO is tested and compared to the other methods on the systems with the number of units in the range of 10–100. Numerical results demonstrate that the IBPSO is superior to other methods reported in the literature in terms of lower production cost and shorter computational time.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Expert Systems with Applications - Volume 36, Issue 4, May 2009, Pages 8049–8055
Journal: Expert Systems with Applications - Volume 36, Issue 4, May 2009, Pages 8049–8055
نویسندگان
Xiaohui Yuan, Hao Nie, Anjun Su, Liang Wang, Yanbin Yuan,