Multi-objective evolutionary algorithm for single and multiple fault service restoration in large-scale distribution systems

Network reconfiguration for service restoration (SR) in distribution systems is a complex optimization\ud problem. For large-scale distribution systems, it is computationally hard to find adequate SR plans in\ud real time since the problem is combinatorial and non-linear, involving several constraints and objectives.\ud Two Multi-Objective Evolutionary Algorithms that use Node-Depth Encoding (NDE) have proved able to\ud efficiently generate adequate SR plans for large distribution systems: (i) one of them is the hybridization\ud of the Non-Dominated Sorting Genetic Algorithm-II (NSGA-II) with NDE, named NSGA-N; (ii) the other is\ud a Multi-Objective Evolutionary Algorithm based on subpopulation tables that uses NDE, named MEAN.\ud Further challenges are faced now, i.e. the design of SR plans for larger systems as good as those for\ud relatively smaller ones and for multiple faults as good as those for one fault (single fault). In order to tackle\ud both challenges, this paper proposes a method that results from the combination of NSGA-N, MEAN and\ud a new heuristic. Such a heuristic focuses on the application of NDE operators to alarming network zones\ud according to technical constraints. The method generates similar quality SR plans in distribution systems\ud of significantly different sizes (from 3860 to 30,880 buses). Moreover, the number of switching operations\ud required to implement the SR plans generated by the proposed method increases in a moderate way with\ud the number of faults.FAPESPCNPqCAPE