Service Restoration With Prioritization of Customers and Switches and Determination of Switching Sequence

Distribution system (DS) service restoration (SR) in contingency situations is one of the most complex and challenging problems in DS operation. It is usually formulated as a multi-objective and multi-constraint optimization problem that must be quickly solved. Several methods have been proposed for its solution, however, most of them still have limitations. Some demand long running time when applied to large-scale DSs modeled with no simplification, whereas others disregard some important aspects of the SR problem. This paper proposes a methodology based on multi-objective evolutionary algorithms for the SR problem and overcoming of such limitations. In contrast to methods reported in the literature, the methodology: 1) deals with large-scale DSs with relatively soft computing time and requires no network topology simplification; 2) prioritizes the operation of remotely controlled switches; 3) prioritizes supply to three levels of priority customers; and 4) provides switching sequences. A mathematical formulation of the problem is also proposed. Several tests were conducted for the evaluation of the methodology and single and multiple fault cases in large-scale DSs (from 631 to 5158 switches) were considered.