Please use this identifier to cite or link to this item:
http://repositorio.ineel.mx/jspui/handle/123456789/149
| A Heuristic algorithm to solve the unit commitment problem for real-life large-scale power systems | |
| JUAN ALVAREZ LOPEZ JOSE LUIS CECILIANO MEZA ROLANDO NIEVA GOMEZ | |
| Acceso Abierto | |
| Artículo | |
| Inglés | |
| 28-Feb-2013 | |
| One of the main needs that power system operators around the world have is to solve complex Unit Commitment models for large-scale power systems in an acceptable computation time. This Paper presents an alternative Heuristic algorithm that successfully addresses this need. The Heuristic algorithm makes use of various optimization techniques such as Mixed Integer Linear Programming (MILP), Quadratic Programming (QP), Quadratically Constrained Programming (QCP), and Dynamic Programming (DP). CPLEX 12.2 is used as the main optimization engine for MILP, QP, and QCP. DP is an in-house algorithm used to obtain the commitment of Combined Cycle Plants (CCPs) when represented with the component-based model | |
| http://repositorio.ineel.mx/jspui/handle/123456789/149 | |
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| 1-s20-s0142061513000446-main.pdf | 699.25 kB | Adobe PDF | View/Open |