Local Search Methods for Min-Max Clearing Problem

• Published in: Shisutemu Seigyo Jouhou Gakkai rombunshi Vol. 35; no. 8; pp. 193 - 201
• Main Authors: Sun, Qiwei, Miyamoto, Toshiyuki, Kitamura, Shoichi, Taniguchi-Matsuoka, Ayako, Naito, Kento, Mori, Kazuyuki, Izui, Yoshio
• Format: Journal Article
• Language: English; Japanese
• Published: Kyoto THE INSTITUTE OF SYSTEMS, CONTROL AND INFORMATION ENGINEERS (ISCIE) 15.08.2022; Japan Science and Technology Agency
• Subjects: Clearing; Electric power distribution; Electric utilities; Integer programming; local search; Min-Max clearing problem; Search methods; set multi-cover problem
• ISSN: 1342-5668; 2185-811X
• DOI: 10.5687/iscie.35.193

In the ongoing power system reform in Japan, the division of transmission and distribution is separated from the former general electric utility and became a general power transmission and distribution business operator. After the reform, the power transmission and distribution business operators will procure reserve power from the reserve market. We have formulated the clearing problem in the reserve market as a 0-1 integer programming problem. This problem can be viewed as a Min-Max set multi-cover problem. Since the set covering problem belongs NP-hard, it is not easy to solve large-scale problems in practical time. In this paper, we propose a greedy solution and local search solution to the Min-Max set multi-cover problem and evaluate its performance by numerical experiments.