OPTIMAL ROTATIONAL LOAD SHEDDING VIA BILINEAR INTEGER PROGRAMMING
Skip to main content
eScholarship
Open Access Publications from the University of California

UC Santa Cruz

UC Santa Cruz Previously Published Works bannerUC Santa Cruz

OPTIMAL ROTATIONAL LOAD SHEDDING VIA BILINEAR INTEGER PROGRAMMING

Creative Commons 'BY-NC-SA' version 4.0 license
Abstract

This paper addresses the problem of managing rotational load shedding schedules for a power distribution network with multiple load zones. An integer optimization problem is formulated to find the optimal number and duration of planned power outages. Various types of damage costs are proposed to capture the heterogeneous load shedding preferences of different zones. The McCormick relaxation along with an effective procedure feasibility recovery is developed to solve the resulting bilinear integer program, which yields a high-quality suboptimal solution. Extensive simulation results corroborate the merit of the proposed approach, which has a substantial edge over existing load shedding schemes.

Many UC-authored scholarly publications are freely available on this site because of the UC's open access policies. Let us know how this access is important for you.

Main Content
For improved accessibility of PDF content, download the file to your device.