抄録
Service restoration problem in distribution systems is formulated as a multi-objective optimization problem which is demanded not only for minimizing the amount of unrestored total loads but also for minimizing the number of the switching operations. The solution of the multi-objective optimization problem is usually obtained with a set of Pareto optimal solutions. The Pareto optimal solutions for the service restoration problem are useful for users to obtain their desired restoration by comparing a Pareto optimal solution with the others. However, the conventional methods cannot obtain plural Pareto optimal solutions in one trial. Therefore, this paper proposes a method for obtaining a Pareto optimal set for the service restoration problem with a genetic algorithm. The genetic algorithm produces many possible solutions in its search process. By utilizing this feature, the proposed method can obtain the Pareto optimal set.
