DeepOPF-V: Solving AC-OPF Problems Efficiently

نویسندگان

چکیده

AC optimal power flow (AC-OPF) problems need to be solved more frequently in the future maintain stable and economic system operation. To tackle this challenge, a deep neural network-based voltage-constrained approach (DeepOPF-V) is proposed solve AC-OPF with high computational efficiency. Its unique design predicts voltages of all buses then uses them reconstruct remaining variables without solving non-linear equations. A fast post-processing process also developed enforce box constraints. The effectiveness DeepOPF-V validated by simulations on IEEE 118/300-bus systems 2000-bus test system. Compared existing studies, achieves decent computation speedup up four orders magnitude comparable performance optimality gap, while preserving feasibility solution.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Evacuation Problems Efficiently —

Earliest arrival flows capture the essence of evacuation planning. Given a network with capacities and transit times on the arcs, a subset of source nodes with supplies and a sink node, the task is to send the given supplies from the sources to the sink “as quickly as possible”. The latter requirement is made more precise by the earliest arrival property which requires that the total amount of ...

متن کامل

Efficiently solving multiple objective optimal control problems

This paper discusses an improved method for solving multiple objective optimal control (MOOC) problems, and efficiently obtaining the set of Pareto optimal solutions. A general MOOC procedure has been introduced in Logist et al. [2007], to derive optimal generic temperature profiles for a steady-state tubular plug flow reactor. This procedure is based on a weighted sum of the different costs, a...

متن کامل

Solving Matching Problems Efficiently in Bipartite Graphs

We investigate the problem maxDMM of computing a largest set of pairwise disjoint maximum matchings in undirected graphs as introduced by P. J. Slater in the case of trees. In this paper, n, m denote, respectively, the number of vertices and the number of edges. We solve maxDMM for bipartite graphs, by providing an O(n 1.5 m/ log n + mn log n)-time algorithm. We design better algorithms for com...

متن کامل

Solving Complex Problems Efficiently with Adaptive Automata

Adaptive technologies are based on the self-modifying property of some systems, which give their users a very powerful and convenient facility for expressing and handling complex problems. In order to accomplish self-modification, systems must be instructed on what exactly to modify, the correct place such an alteration is expected to occur and when adaptive actions have to take place. Therefor...

متن کامل

A stabilized DG-type method for solving efficiently Helmholtz problems

We propose a stabilized discontinuous Galerkin-type method (SDGM) for solving e ciently Helmholtz problems. This mixed-hybrid formulation is a two-step procedure. Step 1 consists in solving well-posed problems at the element partition level of the computational domain, whereas Step 2 requires the solution of a global system whose unknowns are the Lagrange multipliers. The main features of SDGM ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Power Systems

سال: 2022

ISSN: ['0885-8950', '1558-0679']

DOI: https://doi.org/10.1109/tpwrs.2021.3114092