Please use this identifier to cite or link to this item:
http://acervodigital.unesp.br/handle/11449/67981
- Title:
- An active/reactive predispatch model incorporating ramp rate constraints solved by dual decomposition/lagrangian relaxation
- Universidade Estadual Paulista (UNESP)
- The Predispatch model (PD) calculates a short-term generation policy for power systems. In this work a PD model is proposed that improves two modeling aspects generally neglected in the literature: voltage/reactive power constraints and ramp rate constraints for generating units. Reactive power constraints turn the PD into a non-linear problem and the ramp rate constraints couple the problem dynamically in time domain. The solution of the PD is turned into a harder task when such constraints are introduced. The dual decomposition/ lagrangian relaxation technique is used in the solution approach for handing dynamic constraints. As a result the PD is decomposed into a series of independent Optimal Power Flow (FPO) sub problems, in which the reactive power is represented in detail. The solution of the independent FPO is coordinated by means of Lagrange multipliers, so that dynamic constraints are iteratively satisfied. Comparisons between dispatch policies calculated with and without the representation of ramp rate constraints are performed, using the IEEE 30 bus test system. The results point-out the importance of representing such constraints in the generation dispatch policy. © 2004 IEEE.
- 1-Dec-2004
- 2004 IEEE/PES Transmission and Distribution Conference and Exposition: Latin America, p. 633-638.
- 633-638
- Dual decomposition/lagrangian relaxation
- Hydrothermal power systems
- Power generation dispatch
- Ramp rate constraints
- Capacitors
- Costs
- Decomposition
- Electric potential
- Electric transformers
- Reactive power
- Electric power generation
- http://dx.doi.org/10.1109/TDC.2004.1432453
- Acesso restrito
- outro
- http://repositorio.unesp.br/handle/11449/67981
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.