Reliability constrained multi-period generation expansion planning of electrical energy resources using MILP

SUMMARY The main goal of Generation Expansion Planning (GEP) is to minimize total costs associated with new power generating units’ installation subject to technical and economical constraints. This paper addresses the GEP with probabilistic reliability criteria. The Loss‐of‐Load Probability reliabi...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	International transactions on electrical energy systems Ročník 23; číslo 7; s. 961 - 974
Hlavní autoři:	Aghaei, Jamshid, Roosta, Alireza, Akbari, Mohammad Amin, Rabiee, Abdorreza, Gitizadeh, M.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Blackwell Publishing Ltd 01.10.2013
Témata:	Expected Energy Not Served (EENS) Generation Expansion Planning (GEP) Loss-of-Load Probability (LOLP) Mixed Integer Linear Programming (MILP) Reliability Metrics
ISSN:	2050-7038, 2050-7038
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	SUMMARY The main goal of Generation Expansion Planning (GEP) is to minimize total costs associated with new power generating units’ installation subject to technical and economical constraints. This paper addresses the GEP with probabilistic reliability criteria. The Loss‐of‐Load Probability reliability index is explicitly augmented as a new constraint which takes into account the reserve requirements. The outage cost is represented by the Expected Energy Not Served index. Due to nonlinear nature of these reliability indices, the GEP optimization problem with reliability criteria is very complicated to solve. Accordingly, the focus of this work is to deal with the reliability constrained multi‐period GEP problem as a Mixed Integer Linear Programming (MILP). The results in the case study indicate the effect of reliability considerations on decision‐making process. The simulation results also show the superiority of the proposed MILP‐based method in comparison with the well‐known metaheuristic algorithms and Dynamic Programming approach in the viewpoints of the accuracy and computational speed. Copyright © 2012 John Wiley & Sons, Ltd.
Bibliografie:	ark:/67375/WNG-BXHFSCZ5-8 ArticleID:ETEP1632 istex:BE74D12D05CBBDB64A50183870DF59DE61EDD317
ISSN:	2050-7038 2050-7038
DOI:	10.1002/etep.1632