2012
DOI: 10.1016/j.ijepes.2012.01.005
|View full text |Cite
|
Sign up to set email alerts
|

Solving dynamic economic dispatch problem with security constraints using bacterial foraging PSO-DE algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
39
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
8
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 94 publications
(39 citation statements)
references
References 33 publications
0
39
0
Order By: Relevance
“…The dynamic economic dispatch (DED) problem has been extensively studied by SI algorithms such as BFO [242], PSO [243,244,245,246], FA [247], AFSO [248] and ABC algorithms [249,250,251,252,253]. Moreover, a hybrid SFLA algorithm [254] outperformed PSO-and ABC-based algorithms.…”
Section: Continuous Applicationsmentioning
confidence: 99%
“…The dynamic economic dispatch (DED) problem has been extensively studied by SI algorithms such as BFO [242], PSO [243,244,245,246], FA [247], AFSO [248] and ABC algorithms [249,250,251,252,253]. Moreover, a hybrid SFLA algorithm [254] outperformed PSO-and ABC-based algorithms.…”
Section: Continuous Applicationsmentioning
confidence: 99%
“…The several approaches to solve the SCED from 1952 to 2014are presented in [1], [66], [67]- [71]. Single objective SCDED (SOSCDED) problem is formulated as…”
Section: Moded Formulationmentioning
confidence: 99%
“…These solutions are stored in a repository that is used to estimate the density of solutions around a particular solution. The distance (crowding distance) between each pair of solutions is calculated, and then, the solutions are arranged based on their crowding distances, as explained in [62,63].…”
Section: Multi-objective Solution Strategymentioning
confidence: 99%