2019
DOI: 10.3390/en12122335
|View full text |Cite
|
Sign up to set email alerts
|

An Improved DA-PSO Optimization Approach for Unit Commitment Problem

Abstract: Solving the Unit Commitment problem is an important step in optimally dispatching the available generation and involves two stages—deciding which generators to commit, and then deciding their power output (economic dispatch). The Unit Commitment problem is a mixed-integer combinational optimization problem that traditional optimization techniques struggle to solve, and metaheuristic techniques are better suited. Dragonfly algorithm (DA) and particle swarm optimization (PSO) are two such metaheuristic technique… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
20
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 33 publications
(20 citation statements)
references
References 48 publications
0
20
0
Order By: Relevance
“…the optimal binary combination of committed units. proposed AGA gives better results compared to the algorithms proposed in [38] and [39]. This is based on the fact that the transmission line constraint has a big impact on operating costs as it affects the power flow.…”
Section: G Particle Swarm Optimizationmentioning
confidence: 93%
See 1 more Smart Citation
“…the optimal binary combination of committed units. proposed AGA gives better results compared to the algorithms proposed in [38] and [39]. This is based on the fact that the transmission line constraint has a big impact on operating costs as it affects the power flow.…”
Section: G Particle Swarm Optimizationmentioning
confidence: 93%
“…As it was pointed out, the total costs are € 10048.36, compared to [38] and [39], where they amount to € 13292.28 and € 13517.00. Although in these two references it is a classic UC (for a system which consists only thermal power plants), if we take into account that in this paper a non-convex criterion function is considered, but also the transmission line constraint (DC optimal power flow), and on the other hand there is a big difference in total costs, so it can be concluded that the newly…”
Section: International Journal Of Electrical Engineering and Computingmentioning
confidence: 98%
“…In other words, an artificial dragonfly moves within a search space by only assuming values of -1 or 1, where each velocity represents the probability of a bit of position taking the value 1. To be within the range [0,1], the velocity, which is a probability, must be limited [39]. A function used to do this is called the sigmoid function, and is formulated mathematically as follows:…”
Section: Cohesion Strategy   F R Cmentioning
confidence: 99%
“…There are several papers on UC for minimizing system costs, but each of them is distinct from each author's viewpoint. Each manuscript solves UC problem by considering different conditions and constraints [36][37][38][39]. Reference [40] represents a UC problem formulation for minimizing cost as follows:…”
Section: Cost Minimization Ucmentioning
confidence: 99%