配電系統のキャパシタ配置法のための並列タブサーチアルゴリズム

抄録

In this paper, a parallel algorithm of tabu search (TS) is developed to handle capacitor placement in distribution systems. As a metaheuristic approach, TS is effective for solving combinatorial optimization problems. The advantage of meta-heuristics resides that they focus on solutions near a global minimum rather than a local one. The idea is important in saving cost in power system operation and planning. Capacitor placement in distribution systems means the problem that minimizes both network transmission losses and capacitor installation cost while satisfying the voltage and capacitor constraints. It is necessary to determine the location of capacitor installation and the number of capacitor banks. Namely, the problem results in a complicated combinatorial problem. To solve it, this paper proposes parallel tabu search (PTS) that considers the decomposition of the neighborhood and the multiplicity of tabu lengths. To demonstrate the effectiveness, the proposed method is tested in 9-node, 69-node and 345-node distribution systems in comparison with SA, GA and TS.