Application of Binary Cat Swarm Optimization Algorithm for Unit Commitment problem
Publish place: The first national conference on meta-heuristic algorithms and their applications in science and engineering
Publish Year: 1393
نوع سند: مقاله کنفرانسی
زبان: English
View: 1,493
This Paper With 10 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
MHAA01_050
تاریخ نمایه سازی: 17 اسفند 1393
Abstract:
The Unit Commitment (UC) problem is to determine a minimal cost turn-on and turn-off schedule of a set of electrical power generating units to meet a load demand while satisfying a set of operational constraints. The total cost includes fuel, startup, shutdown, and no-load costs. This paper a solution to unit commitment based on a new evolutionary algorithm known as Binary Cat Swarm Optimization (BCSO). In addition, this proposed method involves local search and shuffling process and these are repeated until a required convergence is reached. Tests have been performed in range of 10 up to 100 units systems over a scheduling period of 24 hours. The final results were compared with those obtained BCSO schemes in other same research
Keywords:
Authors
Iraj Faraji
Department of Electrical Engineering, Lorestan University, Lorestan, Iran
Akram Zare Bargabadi
Department of Electrical and Computer Engineering, Alborz Branch, Islamic Azad University, Alborz, Iran
Zakariya Hejrati
Department of Electrical Engineering, Mohaghegh University, Ardebil, Iran
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :