Service Restoration (SR)

The restoration algorithm must guarantee the resulting network topology remains a radial tree structure with no closed loops. Distribution systems are designed and protected for unidirectional power flow; a mesh topology would cause protection miscoordination and circulating currents.

• Graph theory models the grid as nodes (buses) and edges (switches/lines)
• The solution must be a valid spanning tree connecting all energized nodes
• Normally Open Points (NOPs) are closed strategically while a downstream sectionalizing switch is opened to maintain radiality
• Violating this constraint triggers cascading relay trips and potential equipment damage

After a prolonged outage, Cold Load Pickup (CLPU) causes a temporary demand surge 2-5x normal load as thermostatically controlled devices (HVAC, refrigerators) start simultaneously. Restoration algorithms must account for this inrush to prevent immediate re-tripping.

• CLPU current decays exponentially over 10-30 minutes
• Model Predictive Control (MPC) staggers restoration steps to manage the inrush
• Load diversity loss means the aggregated peak far exceeds statistical sum
• Ignoring CLPU is the most common cause of failed restoration attempts

The healthy feeder receiving the transferred load must have sufficient headroom capacity to absorb the new demand without violating thermal limits or causing voltage collapse. This requires real-time loading data from the Outage Management System (OMS) and Distribution Automation (DA) sensors.

• Each candidate feeder is evaluated for remaining ampacity on conductors and transformers
• DistFlow equations calculate the resulting voltage profile along the reconfigured path
• N-1 Criterion may require reserving capacity for a subsequent contingency
• Overloading a healthy feeder cascades the outage to previously unaffected customers

The algorithm must output an ordered sequence of switch operations that minimizes the number of maneuvers while maximizing restored load. Each switching step must be validated for transient stability before execution.

• Mixed-Integer Linear Programming (MILP) formulates switch statuses as binary variables
• Branch Exchange Method iteratively closes a tie switch and opens a sectionalizing switch
• Minimizing switch count reduces wear on aging Intelligent Electronic Devices (IEDs)
• The sequence is simulated in a Digital Twin before field execution to verify safety

Service restoration is inherently a multi-objective optimization problem balancing competing goals: maximizing restored load, minimizing switching operations, equalizing feeder loading, and reducing line losses. There is no single perfect solution.

• Pareto optimal fronts present trade-offs to the operator for final decision
• Conservation Voltage Reduction (CVR) can be applied post-restoration to reduce stress
• Weighting factors prioritize customer count over industrial load criticality
• SAIDI reliability metrics directly penalize every minute of sustained interruption

When Distributed Energy Resources (DERs) are present, restoration may involve intentional islanding — separating a portion of the grid with local generation to maintain supply independently of the main utility system during a wide-area disturbance.

• Microgrid Control Systems manage frequency and voltage within the islanded segment
• IEC 61850 GOOSE messaging enables high-speed peer-to-peer coordination between IEDs
• Synchronization checks are required before reconnecting the island to the main grid
• Soft Open Points (SOPs) provide precise power flow control between islanded feeders

The critical precursor to restoration. Before re-energizing healthy line sections, protective devices must separate the faulted segment. Modern schemes use peer-to-peer GOOSE messaging between IEDs to achieve isolation in under 100ms, preventing the fault from propagating and minimizing the extent of the outage before the restoration algorithm begins its switching sequence.

The non-negotiable topological rule governing all restoration plans. Distribution networks must operate as a spanning tree—a connected graph with no closed loops. This ensures fault currents flow in a single, predictable path, allowing simple overcurrent protection coordination. Every restoration switching sequence must verify that closing a Normally Open Point (NOP) does not create a mesh.

A physical phenomenon that can cause restoration attempts to fail. After a prolonged outage, thermostatically controlled loads (HVAC, refrigerators) lose diversity and start simultaneously upon re-energization. This creates a demand surge 2–5 times normal peak load. Restoration algorithms must model CLPU dynamics to avoid tripping the healthy feeder on overcurrent immediately after transfer.

The reliability planning standard that defines restoration capacity requirements. The grid must survive the failure of any single component—a feeder, transformer, or substation bus—without sustained customer interruption. This mandates that every load point has at least one alternative supply path via tie switches, and that the backup feeder has sufficient spare capacity to accept the transferred load without violating thermal or voltage limits.

The primary regulatory metric that drives investment in automated restoration. SAIDI measures the total minutes of sustained interruption the average customer experiences annually. Self-healing schemes directly improve SAIDI by reducing the manual patrol and switching time. Utilities target SAIDI reductions to avoid financial penalties from performance-based ratemaking.

The dominant mathematical framework for finding globally optimal restoration switching sequences. Switch statuses are modeled as binary integer variables (0 for open, 1 for closed), while power flow physics are expressed as linear constraints using the DistFlow equations. MILP solvers guarantee the solution is the absolute best for minimizing losses or maximizing load restored, unlike heuristic methods.