خدمات تعمیر و مرمت برای شبکه های توزیع نامتعادل با استفاده از ترکیب دو روش الگوریتم ابتکاری

In this paper, two heuristic methods are proposed to find the effective and fast solution for solving service restoration problem in unbalanced three phase distribution networks. Switch selection indices based on analytically approach and practicable heuristic graph-based method are proposed for solving the service restoration problem in unbalanced distribution networks. The problem formulation proposed, consists of three different objective functions: First, minimizing the de-energized customers’ load, second, minimizing the number of switching operation, and finally, customer’s priority. A suitable assignment of switch indices to all tie switches (ts) in networks are used to find best solution and decrease number of switching operation. New graph-based approach for finding best sectionalizes switch (ss) and minimizing voltage drop’s amount is utilized. The validity of these approaches has been tested on the two unbalanced three phase distribution networks. Results have been presented for modified IEEE 13-node and IEEE 37-node test case. The fastness and effectiveness convergence of these approaches helps finding best solution for service restoration problem.