2011
DOI: 10.1155/2011/942672
|View full text |Cite
|
Sign up to set email alerts
|

Contingency‐Constrained Optimal Power Flow Using Simplex‐Based Chaotic‐PSO Algorithm

Abstract: This paper proposes solving contingency-constrained optimal power flow (CC-OPF) by a simplex-based chaotic particle swarm optimization (SCPSO). The associated objective of CC-OPF with the considered valve-point loading effects of generators is to minimize the total generation cost, to reduce transmission loss, and to improve the bus-voltage profile under normal or postcontingent states. The proposed SCPSO method, which involves the chaotic map and the downhill simplex search, can avoid the premature convergenc… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(10 citation statements)
references
References 38 publications
0
10
0
Order By: Relevance
“…The best, average and worst results, among 20 trial runs, obtained from the proposed EGSA and bi-level approach for this test case are compared with the results of EP [27], mixed integer genetic algorithm (MIGA) [27] and simplex-based chaotic-PSO (SCPSO) [28] in Table 6. It is seen that the best, average and worst results of the bi-level approach are better than the best, average and worst results of the other methods of Table 6 (only the best cost of SCPSO is reported in [28]). Even the worst result of the bi-level approach is better than the best result of the other methods.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…The best, average and worst results, among 20 trial runs, obtained from the proposed EGSA and bi-level approach for this test case are compared with the results of EP [27], mixed integer genetic algorithm (MIGA) [27] and simplex-based chaotic-PSO (SCPSO) [28] in Table 6. It is seen that the best, average and worst results of the bi-level approach are better than the best, average and worst results of the other methods of Table 6 (only the best cost of SCPSO is reported in [28]). Even the worst result of the bi-level approach is better than the best result of the other methods.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…Evaluate the fitness values of the scroungers and rangers using (18). If the scroungers and rangers find better positions, then they move to the positions; otherwise, they keep still.…”
Section: Application Of Igso To Opf_vple Problemmentioning
confidence: 99%
“…In [17], both the valvepoint loading effects and transmission security under line outage condition are considered, and the GA with arithmetic crossover and mutation strategy was adopted to solve this problem. In [18], a simplex-based chaotic PSO was proposed to solve the securityconstrained OPF_VPLE problem. The problems in [17][18] can be also regarded as multi-objective optimization problems.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Each particle remembers its best position obtained so far, which is denoted as pbest (P t i ). It also receives the globally best position achieved by any particle in the population, which is denoted as gbest (G t i ) [20][21][22][23][24][25]. The updated velocity of each particle can be calculated using the present velocity and the distances from pbest and gbest.…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%