2015
DOI: 10.1002/etep.2164
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive bacterial foraging and genetic algorithm for unit commitment problem with ramp rate constraint

Abstract: SUMMARYSolving unit commitment (UC) problem is one of the most critical tasks in electric power system operations. Therefore, proposing an accurate method to solve this problem is of great interest. The original bacterial foraging (BF) algorithm suffers from poor convergence characteristics for larger constrained optimization problems. In addition, the stopping criterion used in the original BF algorithm increases the computation burden of the original algorithm in many cases. To overcome these drawbacks, a hy… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 55 publications
0
4
0
Order By: Relevance
“…In turn, these algorithms can be combined with each other to achieve a better performance, or even with commercial solvers if the problem is divided into multiple resolution stages. Some examples in the unit commitment literature are in [95][96][97][98][99]. Furthermore, an excellent state-of-art on EO is presented in [100].…”
Section: Optimization Algorithmsmentioning
confidence: 99%
“…In turn, these algorithms can be combined with each other to achieve a better performance, or even with commercial solvers if the problem is divided into multiple resolution stages. Some examples in the unit commitment literature are in [95][96][97][98][99]. Furthermore, an excellent state-of-art on EO is presented in [100].…”
Section: Optimization Algorithmsmentioning
confidence: 99%
“…In the fourth case, the combination of two variants is implemented, to further amplify the performance of this proposed approach. A hybrid adaptive bacterial foraging, with GA (HABFGA) method was examined by Elattar [233], with the combination of BFA and GA, with adaptive stopping criterion.…”
Section: Uc Problem Incorporated With Hybrid Evolutionary Optimizatio...mentioning
confidence: 99%
“…The classical UC problem aims to minimize the total cost of system while selecting generators availability schedule, satisfying load demand, ramping, and other constraints over given time horizon as follows: italicMin0.25emCtotal=t=1Tn=1normalNnormalG{}fn()P()n,tnormalGUn,t+SUn,t+SDn,t, trueU()n,t=1,iffalse∑h=titalicupnt1U()n,h<italicMUTn,U()n,t=1,iffalse∑h=titalicdownnt11U()n,h<italicMDTn. For the total period of M intervals and N units in UC, the maximum number of possible combinations is 2 N × M .…”
Section: Description Of C‐scucmentioning
confidence: 99%
“…The classical UC problem aims to minimize the total cost of system while selecting generators availability schedule, satisfying load demand, ramping, and other constraints over given time horizon as follows 21,29 :…”
Section: Security Constrained Unit Commitment (Scuc) Problemmentioning
confidence: 99%