Solving Optimal Unit Commitment and Congestion Management Problems by Improved Honey Bee Mating Optimization
Publish place: Third National Conference on Electrical Engineering of Iran
Publish Year: 1394
Type: Conference paper
Language: English
View: 584
This Paper With 9 Page And PDF Format Ready To Download
- Certificate
- I'm the author of the paper
Export:
Document National Code:
INCEE03_096
Index date: 1 November 2016
Solving Optimal Unit Commitment and Congestion Management Problems by Improved Honey Bee Mating Optimization abstract
Improved Honey Bee Mating Optimization (IHBMO) algorithm is developed and applied for Unit Commitment Problem (UCP) through Congestion Management (CM) problem in this paper. Actually, the optimal solution of the nonlinear schedulingproblem is important and it has complex computational optimization process. This problem is a challenging undertaking toaccommodate variations in the power system, especially when several thermal units are employed. IHBMO technique is a hybridevolutionary algorithm which combines the power of genetic algorithms and simulated annealing with a fast problem specific local search heuristic to obtain the best possible solution. To demonstrate the effectiveness and robustness of the proposed algorithm a system with ten thermal units in various condition is considered. The simulation results are compared with those obtained from traditional unit commitment and heuristic algorithms
Solving Optimal Unit Commitment and Congestion Management Problems by Improved Honey Bee Mating Optimization Keywords:
Solving Optimal Unit Commitment and Congestion Management Problems by Improved Honey Bee Mating Optimization authors
Masoud Najafzadeh
Azerbaijan Regional Electricity co, Ardebil,
Iraj Faraji
Electrical Engineering Dept. Lorestan University, Iran,
Latif Rezaei
Ardebil Province Electricity Distribution co,
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :