Constrained unit commitment and dispatch optimization
In this paper we propose an algorithm that solves the Unit Commitment and an Economic Dispatch problems at once. The Unit Commitment problem considers the load forecasts to determine the operating schedule of the power units for the next planning period, and it is solved using a metaheuristic with C...
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | book |
| Idioma: | eng |
| Publicado em: |
2006
|
| Assuntos: | |
| Texto completo: | https://hdl.handle.net/10216/94469 |
| País: | Portugal |
| Oai: | oai:repositorio-aberto.up.pt:10216/94469 |
| Resumo: | In this paper we propose an algorithm that solves the Unit Commitment and an Economic Dispatch problems at once. The Unit Commitment problem considers the load forecasts to determine the operating schedule of the power units for the next planning period, and it is solved using a metaheuristic with Constraint Oriented Neighbourhoods. The Economic Dispatch problem consists on the optimization of operating costs under the general constraints of the power system including network constraints. In this work it is solved by an integrated methodology using a simplex method applied to the linearized problem. |
|---|