2010 IEEE International Conference on Power and Energy 2010
DOI: 10.1109/pecon.2010.5697705
|View full text |Cite
|
Sign up to set email alerts
|

Contingency based congestion management and cost minimization using bee colony optimization technique

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0

Year Published

2014
2014
2017
2017

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(2 citation statements)
references
References 16 publications
0
1
0
Order By: Relevance
“…The constructive BCO constructs a population of solutions from scratch in a number of constructive stages consisting of a number of constructive moves in a single iteration; while improvement BCO improves a given population of complete solutions in a number of improvement stages consisting of a number of improvement moves in a single iteration. Since its inception, BCOc has been successfully applied to solve many complex optimization problems in science and engineering (Teodorović and Dell'Orco, 2005;Teodorovic et al, 2006;Wong et al, 2008a;Wong et al, 2008b;Wong et al, 2009;Wong et al, 2010;Chaiyatham et al, 2009;Low et al, 2009;Zeng et al, 2010;Rahim et al, 2010;Arabnejad et al, 2011;Huang and Lin, 2011;Chaiyatham and Ngamroo, 2012;Davidović et al, 2012;Todorovic and Petrovic, 2013;Teodorović et al, 2013;Amador-Angulo and Castillo, 2014;Alzaqebah and Abdullah, 2015). Davidović et al (2011) observed that BCOc did not yield suitable solutions for benchmarked problems and investigated BCOi to obtain better solutions.…”
Section: Improvement Based Bcomentioning
confidence: 99%
“…The constructive BCO constructs a population of solutions from scratch in a number of constructive stages consisting of a number of constructive moves in a single iteration; while improvement BCO improves a given population of complete solutions in a number of improvement stages consisting of a number of improvement moves in a single iteration. Since its inception, BCOc has been successfully applied to solve many complex optimization problems in science and engineering (Teodorović and Dell'Orco, 2005;Teodorovic et al, 2006;Wong et al, 2008a;Wong et al, 2008b;Wong et al, 2009;Wong et al, 2010;Chaiyatham et al, 2009;Low et al, 2009;Zeng et al, 2010;Rahim et al, 2010;Arabnejad et al, 2011;Huang and Lin, 2011;Chaiyatham and Ngamroo, 2012;Davidović et al, 2012;Todorovic and Petrovic, 2013;Teodorović et al, 2013;Amador-Angulo and Castillo, 2014;Alzaqebah and Abdullah, 2015). Davidović et al (2011) observed that BCOc did not yield suitable solutions for benchmarked problems and investigated BCOi to obtain better solutions.…”
Section: Improvement Based Bcomentioning
confidence: 99%
“…When a contingency occurs in a branch, the remaining branches in the network can experience greater loading and be at a higher risk of network congestion [4][5][6][7]. While traditional security analysis uses the N À 1 criterion this does not account for variation in output of wind leading to post contingency congestion and curtailment of wind.…”
Section: Introductionmentioning
confidence: 99%