Optimization Online


Strong Mixed-Integer Formulations for Power System Islanding and Restoration

Georgios Patsakis(gpatsakis***at***berkeley.edu)
Deepak Rajan(rajan3***at***llnl.gov)
Ignacio Aravena(aravenasolis1***at***llnl.gov)
Shmuel Oren(shmuel***at***berkeley.edu)

Abstract: The Intentional Controlled Islanding (ICI) and the Black Start Allocation (BSA) are two examples of problems in the power systems literature that have been formulated as Mixed Integer Programs (MIPs). A key consideration in both of these problems is that each island must have at least one energized generator. In this paper, we provide three alternative MIP formulations for this restriction, show their equivalence, and prove that two of them are stronger in terms of their linear programming relaxation than the one most commonly used in the power systems literature. Since the time to solve MIPs can vary significantly between equivalent formulations, we also present computational experiments on IEEE test systems for the ICI and BSA problems. We observe that a polynomially separable, exponential in size, strong formulation yields the best performance for the BSA problem and exhibits a comparable performance to a linear in size, weak formulation for the ICI problem.

Keywords: Black Start Allocation, Power System Restoration, Controlled Islanding, Mixed Integer Programming, Graph Partitioning, Topology Optimization

Category 1: Integer Programming

Category 2: Combinatorial Optimization (Branch and Cut Algorithms )

Category 3: Combinatorial Optimization (Polyhedra )


Download: [PDF]

Entry Submitted: 11/05/2018
Entry Accepted: 11/06/2018
Entry Last Modified: 11/05/2018

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society