A Reactive Power Resource Planning by Multi-stage Tabu Search

Bibliographic Information

Other Title
  • 多重タブー探索による無効電力設備計画
  • タジュウ タブー タンサク ニ ヨル ムコウ デンリョク セツビ ケイカク

Search this article

Abstract

A reactive power resource planning problem is generally formulated as a large-scale mixed integer programming problem, and is mathematically hard to solve. In this paper, an approach named ‘multi-stage tabu search’ is proposed to solve the problem, where tabu-search is used in two stages. One is used to determine the optimal installation of reactive power resources. The other is used to determine the optimal operation of the reactive power resources for several pre-determined operational states. To reduce the computational burden, the sensitivity analysis is also introduced for selecting the efficient neighborhood solutions of the tabu search. Numerical examples are shown to demonstrate the validity of the method.

Journal

Citations (2)*help

See more

References(22)*help

See more

Details 詳細情報について

Report a problem

Back to top