Method for Loss Minimum Re-configuration Problem of Distribution System by Tabu Search

Bibliographic Information

Other Title
  • 配電系統損失最小化問題のタブー探索を用いた解法
  • ハイデン ケイトウ ソンシツ サイショウカ モンダイ ノ タブー タンサク オ モチイタ カイホウ

Search this article

Description

This paper proposes a loss minimum reconfiguration method by Tabu Search for open loop radial distribution system with distributed generators. The problem is to find the optimal normal open sectionalizing switch positions which minimize the total distribution line losses subjected to the line/transformer capacity constraints and voltage constraint. Generally, the problem is mathematically formulated as a complex combinatorial optimization problem or mixed integer programming problem, and is solved by using mathematical programming method, heuristic algorithm, intelligent method, etc. However, satisfactory algorithm for power companies has not yet been attained both in computational burden and solution accuracy. Thus, in this paper, the authors propose a method to solve the above problem by using Tabu Search (TS) method. Reverse power flow caused by distributed generators can be included in the solution algorithm. TS is one of meta-heuristic algorithms, and sometimes evaluated to be better compared with Genetic Algorithm (GA) or Simulated Annealing (SA) from viewpoints of both computational speed and solution accuracy. In order to evaluate the validity and efficiency of the algorithm, several numerical examples are shown in this paper.

Journal

Citations (20)*help

See more

References(19)*help

See more

Details 詳細情報について

Report a problem

Back to top