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

Particle swarm optimization based generation maintenance scheduling using probabilistic approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 6 publications
0
2
0
Order By: Relevance
“…The aim of PMS problem can be both economic-driven as well as reliability-driven. Economic driven minimizes total operation expenditures over a scheduling time horizon [3][4][5][6][7]; while reliability driven utilizes several reliability indices such as: expected lack of peak net reserve, expected energy not supplied (EENS), and loss of load probability (LOLP) [8][9][10][11].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The aim of PMS problem can be both economic-driven as well as reliability-driven. Economic driven minimizes total operation expenditures over a scheduling time horizon [3][4][5][6][7]; while reliability driven utilizes several reliability indices such as: expected lack of peak net reserve, expected energy not supplied (EENS), and loss of load probability (LOLP) [8][9][10][11].…”
Section: Introductionmentioning
confidence: 99%
“…The aim of PMS problem can be both economic-driven as well as reliability-driven. Economic driven minimizes total operation expenditures over a scheduling time horizon [3][4][5][6][7]; while reliability driven utilizes several reliability indices such as: expected lack of peak net reserve, expected energy not supplied (EENS), and loss of load probability (LOLP) [8][9][10][11].This paper emphasizes on minimizing the total operation and maintenance expenditures in order to investigate the economic benefits of PMS. Indeed, PMS problem is contemplated as a large scale, non-convex, and mixed integer combinatorial optimization problem which can be solved via different deterministic [3,12], heuristic [2,4,[13][14][15][16], and hybrid methods [17][18][19][20], in previous decades.…”
mentioning
confidence: 99%