A new MILP based approach for unit commitment in power production planning
Data(s) |
13/01/2014
13/01/2014
2013
|
---|---|
Resumo |
This paper presents a complete, quadratic programming formulation of the standard thermal unit commitment problem in power generation planning, together with a novel iterative optimisation algorithm for its solution. The algorithm, based on a mixed-integer formulation of the problem, considers piecewise linear approximations of the quadratic fuel cost function that are dynamically updated in an iterative way, converging to the optimum; this avoids the requirement of resorting to quadratic programming, making the solution process much quicker. From extensive computational tests on a broad set of benchmark instances of this problem, the algorithm was found to be flexible and capable of easily incorporating different problem constraints. Indeed, it is able to tackle ramp constraints, which although very important in practice were rarely considered in previous publications. Most importantly, optimal solutions were obtained for several well-known benchmark instances, including instances of practical relevance, that are not yet known to have been solved to optimality. Computational experiments and their results showed that the method proposed is both simple and extremely effective. |
Identificador |
http://dx.doi.org/10.1016/j.ijepes.2012.08.046 0142-0615 |
Idioma(s) |
eng |
Publicador |
Elsevier |
Relação |
International Journal of Electrical Power & Energy Systems; Vol. 44, Issue 1 http://www.sciencedirect.com/science/article/pii/S0142061512004942 |
Direitos |
openAccess |
Palavras-Chave | #Unit commitment #Combinatorial optimisation #Mixed-integer programming |
Tipo |
article |