Reactive power dispatch and planning using a non-linear branch-and-bound algorithm

Author(s): C.R.N. Estevam ; M.J. Rider ; E. Amorim ; J.R.S. Mantovani
DOI: 10.1049/iet-gtd.2009.0422

For access to this article, please select a purchase option:

Buy article PDF

Buy Knowledge Pack

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership

Recommend Title Publication to library

IET Generation, Transmission & Distribution — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Author(s): C.R.N. Estevam ¹ ; M.J. Rider ¹ ; E. Amorim ² ; J.R.S. Mantovani ¹
- Affiliations: 1: Departamento de Engenharia Elétrica, Faculdade de Engenharia de Ilha Solteira, UNESP – Universidade Estadual Paulista, Ilha Solteira, Brazil
  2: Departamento de Engenharia Elétrica da, Universidade Federal de Mato Grasso do Sul-UFMS, Campo Grande, Brazil
Source: Volume 4, Issue 8, August 2010, p. 963 – 973
DOI: 10.1049/iet-gtd.2009.0422 , Print ISSN 1751-8687, Online ISSN 1751-8695

This study proposes the use of a non-linear branch-and-bound (B&B) algorithm to solve the reactive power dispatch and planning problem of an electrical power system. The problem is formulated as a mixed integer non-linear programming (MINLP) problem. The MINLP is relaxed resulting in a set of non-linear programming (NLP) problems, which are solved at each node of the B&B tree through a primal dual-interior point algorithm. The non-linear B&B algorithm proposed has special fathoming criteria to deal with non-linear and multimodal optimisation models. The fathoming tests are redefined, adding a safety margin value to the objective function of each NLP problem before they are fathomed through the objective function criteria, avoiding convergence to local optimum solutions. The results are presented using three test systems from the specialised literature. The B&B algorithm found several optimum local solutions and the best solution was found after solving some NLP problems, with little computational effort.

References

1. 1)
  - Y.C. Wu , A.S. Debs , R.E. Marsten . A direct nonlinear predictor–corrector primal–dual interior point algorithm for optimal power flows. IEEE Trans. Power Syst. , 2 , 876 - 883
2. 2)
  - Lebow, W.M., Mehra, R.X., Nadira, R.: `Optimization of reactive volt–ampere (VAr) sources in system planning', EPRI Report EL-3729, 1984, vol. 1.
3. 3)
  - M.J. Rider , A.V. Garcia , R. Romero . Transmission system expansion planning by a branch-and-bound algorithm. IET Gener. Transm. Distrib. , 1 , 90 - 99
4. 4)
  - J.R.S. Mantovani , S.A.G. Modesto , A.V. Garcia . VAr planning using genetic algorithm and linear programming. IEE Proc. Gener. Transm. Distrib. , 3 , 257 - 262
5. 5)
  - S. Granville . Optimal reactive dispatch through interior point methods. IEEE Trans. Power Syst. , 1 , 136 - 146
6. 6)
  - University of Washington. Available at: www.ee.washington.edu/research/pstca (accessed on 11/19/2008).
7. 7)
  - K. Lba . Reactive power optimization by genetic algorithm. IEEE Trans. Power Syst. , 2 , 685 - 692
8. 8)
  - W.M. Lebow , R. Rouhani , R. Nadira . A hierarchical approach to reactive volt ampere (VAr) optimization in system planning. IEEE Trans. Power Appar. Syst. , 8 , 2051 - 2057
9. 9)
  - M. Iba , H. Suzuki , K. Suzuki , K.A. Suzuki . Practical reactive power allocation/operation planning using successive linear programming. IEEE Trans. Power Syst. , 2 , 558 - 566
10. 10)
  - S. Granville , M.V.F. Pereira , A. Monticelli . An integrated methodology for VAr sources planning. IEEE Trans. Power Syst. , 2 , 549 - 557
11. 11)
  - S. Haffner , A. Monticelli , A. Garcia , R. Romero . Specialised branch-and-bound algorithm for transmission network expansion planning. IEE Proc. Gener. Transm. Distrib. , 5 , 482 - 488
12. 12)
  - M.J. Rider , C.A. Castro , M.F. Bedriñana , A.V. Garcia . Towards a fast and robust interior point method for power system applications. Proc. IEE Gener. Transm. Distrib. , 5 , 575 - 581
13. 13)
  - J.R.S. Mantovani , A.V. Garcia . A heuristic method for reactive power planning. IEEE Trans. Power Syst. , 1 , 68 - 74
14. 14)
  - Y. Hong , C. Liu . A heuristic and algorithmic approach to VAr planning. IEEE Trans. Power Syst. , 2 , 505 - 512
15. 15)
  - S.S. Sharif , J.H. Taylor , E.F. Hill , B. Scott , D. Daley . Real-time implementation of optimal reactive power flow. IEEE Power Engng. Rev. , 8 , 47 - 51
16. 16)
  - H.A. Taha . (1975) Integer programming: theory applications and computations.
17. 17)
  - K. Zollenkopf , J.K. Reid . (1971) Bi-factorisation – basic computational algorithm and programming techniques.
18. 18)
  - T. Gomes , I.J. Pérez-Arriaga , J. Lumbreras , V.M. Parra . A security-constrained decomposition approach to optimal reactive power planning. IEEE Trans. Power Syst. , 3 , 1069 - 1076
19. 19)
  - S. Segura , R. Romero , M.J. Rider . Efficient heuristic algorithm used for optimal capacitor placement in distribution systems. Int. J. Electr. Power Energy Syst. , 1 , 71 - 78

Reactive power dispatch and planning using a non-linear branch-and-bound algorithm

Reactive power dispatch and planning using a non-linear branch-and-bound algorithm

Buy article PDF

Buy Knowledge Pack

Thank you

References

Related content