Power generation expansion planning with emission control: a nonlinear model and a GA-based heuristic approach

This paper presents an application of genetic algorithms (GA) for solving the long‐term power generation expansion planning (PGEP) problem, a highly constrained nonlinear discrete optimization problem. The problem is formulated into a mixed integer nonlinear programming (MINLP) program that determin...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of energy research Jg. 30; H. 2; S. 81 - 99
Hauptverfasser: Sirikum, Jiraporn, Techanitisawad, Anulark
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Chichester, UK John Wiley & Sons, Ltd 01.02.2006
Wiley
Schlagworte:
Applied sciences
emission modelling
Energy
Energy. Thermal use of fuels
Exact sciences and technology
genetic algorithms
Installations for energy generation and conversion: thermal and electrical energy
mixed integer nonlinear programming
power generation expansion planning
Thermal power plants
Costs
power generation expansion planning
Power production
Thermal power plant
Non linear programming
genetic algorithms
Modeling
Optimization
Case study
mixed integer nonlinear programming
emission modelling
Genetic algorithm
Heuristic method
Models
Planning
Expansion
ISSN:0363-907X, 1099-114X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper presents an application of genetic algorithms (GA) for solving the long‐term power generation expansion planning (PGEP) problem, a highly constrained nonlinear discrete optimization problem. The problem is formulated into a mixed integer nonlinear programming (MINLP) program that determines the most economical investment plan for additional thermal power generating units over a planning horizon, subject to the requirements of power demands, power capacities, loss of load probability (LOLP) levels, locations, and environmental limitations. Computational results show that the GA‐based heuristic method can solve the PGEP problem effectively and more efficiently at a significant saving in runtime, when compared with a commercial optimization package. Copyright © 2005 John Wiley & Sons, Ltd.
Bibliographie:ArticleID:ER1125
istex:0364055E1CD205B79DCAB207FA0846DA1B0D8860
ark:/67375/WNG-ZX2NSJ0P-C
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:0363-907X
1099-114X
DOI:10.1002/er.1125