New Cycle-based Formulation, Cost Function, and Heuristics for DC OPF Based Controlled Islanding
This paper presents a new formulation for intentional controlled islanding (ICI) of power transmission grids based on mixed-integer linear programming (MILP) DC optimal power flow (OPF) model. We highlight several deficiencies of the most well-known formulation for this problem and propose new enhancements for their improvement. In particular, we propose a new alternative optimization objective that may be more suitable for ICI than the minimization of load shedding, a new set of island connectivity constraints, and a new set of constraints for DC OPF with switching, and a new MILP heuristic to find initial feasible solutions for ICI. It is shown that the proposed improvements help to reduce the final optimality gaps as compared to the benchmark model on several test instances.
Code (1)
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
On the Constrained Least-cost Tour Problem
We introduce the Constrained Least-cost Tour (CLT) problem: given an undirected graph with weight and cost functions on the edges, minimise the total cost of a tour rooted at a start vertex such that the total weight lie…
Unsupervised Learning for the Elementary Shortest Path Problem
The Elementary Shortest-Path Problem(ESPP) seeks a minimum cost path from s to t that visits each vertex at most once. The presence of negative-cost cycles renders the problem NP-hard. We present a probabilistic method f…
Graph Neural NetworkOptimal Transport driven CycleGAN for Unsupervised Learning in Inverse Problems
To improve the performance of classical generative adversarial network (GAN), Wasserstein generative adversarial networks (W-GAN) was developed as a Kantorovich dual formulation of the optimal transport (OT) problem usin…
Computed Tomography (CT)Generative Adversarial NetworkSuper-ResolutionHeuristic solutions to robust variants of the minimum-cost integer flow problem
This paper deals with robust optimization applied to network flows. Two robust variants of the minimum-cost integer flow problem are considered. Thereby, uncertainty in problem formulation is limited to arc unit costs an…
ARCDORY: Automatic End-to-End Deployment of Real-World DNNs on Low-Cost IoT MCUs
The deployment of Deep Neural Networks (DNNs) on end-nodes at the extreme edge of the Internet-of-Things is a critical enabler to support pervasive Deep Learning-enhanced applications. Low-Cost MCU-based end-nodes have l…
C++ codeTiling & Deployment