A mathematical programming approach to service restoration for distribution systems

• Published in: Electrical engineering in Japan Vol. 135; no. 4; pp. 35 - 42
• Main Authors: Nagata, Takeshi, Jin, Jun, Hatakeyama, Syuichi, Sasaki, Hiroshi
• Format: Journal Article
• Language: English
• Published: New York John Wiley & Sons, Inc 01.06.2001
• Subjects: mathematical programming; power distribution network; restoration cost; service restoration
• ISSN: 0424-7760; 1520-6416
• DOI: 10.1002/eej.1040

This paper aims to develop a suitable power system restoration method by using mathematical programming (MP). Generally, the problem of determining the target configuration can be formulated as a mixed integer programming (MIP) problem. Whether or not each branch is included in a target system is expressed as a 0–1 variable, while the other constraints such as the demand and supply balance conditions are formulated in terms of continuous variables. Although an MP‐based method can obtain an optimal solution under specified operational constraints, in the case of large‐scale problems the solution time often exceeds the computation time that is practically available due to combinatorial explosion. The object of this paper is to develop an efficient solution algorithm for service restoration in distribution systems. First, an MIP problem is solved to determine the sound network configuration that maximizes the available power to the out‐of‐service area, then an MIP problem is solved to determine the target configuration for the out‐of‐service network. The proposed method has been applied to distribution system restoration problems, and simulation results demonstrate its effectiveness. © 2001 Scripta Technica, Electr Eng Jpn, 135(4): 35–42, 2001