A Comparative Study of Unit Commitment Problem by Dynamic Programming and Genetic Algorithm

Author(s):  
R. Krishna Mohan ◽  
M. Gopichand Naik ◽  
S. Rajendra Prasad
2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
Sahbi Marrouchi ◽  
Souad Ben Saber

Due to the continuous increase of the population and the perpetual progress of industry, the energy management presents nowadays a relevant topic that concerns researchers in electrical engineering. Indeed, in order to establish a good exploitation of the electrical grid, it is necessary to solve technical and economic problems. This can only be done through the resolution of the Unit Commitment Problem. Unit Commitment Problem allows optimizing the combination of the production units’ states and determining their production planning, in order to satisfy the expected consumption with minimal cost during a specified period which varies usually from 24 hours to one week. However, each production unit has some constraints that make this problem complex, combinatorial, and nonlinear. This paper presents a comparative study between a strategy based on hybrid gradient-genetic algorithm method and two strategies based on metaheuristic methods, fuzzy logic, and genetic algorithm, in order to predict the combinations and the unit commitment scheduling of each production unit in one side and to minimize the total production cost in the other side. To test the performance of the optimization proposed strategies, strategies have been applied to the IEEE electrical network 14 busses and the obtained results are very promising.


1999 ◽  
Vol 119 (3) ◽  
pp. 333-343 ◽  
Author(s):  
Toru Takata ◽  
Junichi Takahashi ◽  
Hiroomi Yokoi ◽  
Hiroshi Nakano ◽  
Mari Aoyagi ◽  
...  

Author(s):  
Guillaume Sandou ◽  
Stéphane Font ◽  
Sihem Tebbani ◽  
Arnaud Hiret ◽  
Christian Mondon

2008 ◽  
Author(s):  
Anant Oonsivilai ◽  
Boonruang Marungsri ◽  
Nader Barsoum ◽  
Sermsak Uatrongjit ◽  
Pandian Vasant

Sign in / Sign up

Export Citation Format

Share Document