Optimal Rotational Load Shedding via Bilinear Integer Programming
For power grid operators, this provides a more effective method to schedule load shedding that accounts for heterogeneous zone preferences, reducing damage costs.
The paper formulates an integer optimization problem for rotational load shedding in power distribution networks, using McCormick relaxation and feasibility recovery to solve the bilinear integer program, achieving high-quality suboptimal solutions with substantial improvement over existing schemes.
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.