اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدReinforcing Power Grid Transmission with FACTS Devices
134
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We explore optimization methods for planning the placement, sizing and operations of Flexible Alternating Current Transmission System (FACTS) devices installed into the grid to relieve congestion created by load growth or fluctuations of intermittent renewable generation. We limit our selection of FACTS devices to those that can be represented by modification of the inductance of the transmission lines. Our master optimization problem minimizes the $l_1$ norm of the FACTS-associated inductance correction subject to constraints enforcing that no line of the system exceeds its thermal limit. We develop off-line heuristics that reduce this non-convex optimization to a succession of Linear Programs (LP) where at each step the constraints are linearized analytically around the current operating point. The algorithm is accelerated further with a version of the cutting plane method greatly reducing the number of active constraints during the optimization, while checking feasibility of the non-active constraints post-factum. This hybrid algorithm solves a typical single-contingency problem over the MathPower Polish Grid model (3299 lines and 2746 nodes) in 40 seconds per iteration on a standard laptop---a speed up that allows the sizing and placement of a family of FACTS devices to correct a large set of anticipated contingencies. From testing of multiple examples, we observe that our algorithm finds feasible solutions that are always sparse, i.e., FACTS devices are placed on only a few lines. The optimal FACTS are not always placed on the originally congested lines, however typically the correction(s) is made at line(s) positioned in a relative proximity of the overload line(s).
قيم البحث
اقرأ أيضاً
We consider a simple system with a local synchronous generator and a load whose power consumption is a random process. The most probable scenario of system failure (synchronization loss) is considered, and it is argued that its knowledge is virtually
enough to estimate the probability of failure per unit time. We discuss two numerical methods to obtain the optimal evolution leading to failure.
This paper proposes to use stochastic conic programming to address the challenge of large-scale wind power integration to the power system. Multiple wind farms are connected through the voltage source converter (VSC) based multi-terminal DC (VSC-MTDC
) system to the power network supported by the Flexible AC Transmission System (FACTS). The optimal operation of the power network incorporating the VSC-MTDC system and FACTS devices is formulated in a stochastic conic programming framework accounting the uncertainties of the wind power generation. A methodology to generate representative scenarios of power generations from the wind farms is proposed using wind speed measurements and wind turbine models. The nonconvex transmission network constraints including the VSC-MTDC system and FACTS devices are convexified through the proposed second-order cone AC optimal power flow model (SOC-ACOPF) that can be solved to the global optimality using interior point method. In order to tackle the computational challenge due to the large number of wind power scenarios, a modified Benders decomposition algorithm (M-BDA) accelerated by parallel computation is proposed. The energy dispatch of conventional power generators is formulated as the master problem of M-BDA. Numerical results for up to 50000 wind power scenarios show that the proposed M-BDA approach to solve stochastic SOC-ACOPF outperforms the traditional single-stage (without decomposition) solution approach in both convergence capability and computational efficiency. The feasibility performance of the proposed stochastic SOC-ACOPF model is also demonstrated.
Transmission line failures in power systems propagate and cascade non-locally. This well-known yet counter-intuitive feature makes it even more challenging to optimally and reliably operate these complex networks. In this work we present a comprehens
ive framework based on spectral graph theory that fully and rigorously captures how multiple simultaneous line failures propagate, distinguishing between non-cut and cut set outages. Using this spectral representation of power systems, we identify the crucial graph sub-structure that ensures line failure localization -- the network bridge-block decomposition. Leveraging this theory, we propose an adaptive network topology reconfiguration paradigm that uses a two-stage algorithm where the first stage aims to identify optimal clusters using the notion of network modularity and the second stage refines the clusters by means of optimal line switching actions. Our proposed methodology is illustrated using extensive numerical examples on standard IEEE networks and we discussed several extensions and variants of the proposed algorithm.
Deriving fast and effectively coordinated control actions remains a grand challenge affecting the secure and economic operation of todays large-scale power grid. This paper presents a novel artificial intelligence (AI) based methodology to achieve mu
lti-objective real-time power grid control for real-world implementation. State-of-the-art off-policy reinforcement learning (RL) algorithm, soft actor-critic (SAC) is adopted to train AI agents with multi-thread offline training and periodic online training for regulating voltages and transmission losses without violating thermal constraints of lines. A software prototype was developed and deployed in the control center of SGCC Jiangsu Electric Power Company that interacts with their Energy Management System (EMS) every 5 minutes. Massive numerical studies using actual power grid snapshots in the real-time environment verify the effectiveness of the proposed approach. Well-trained SAC agents can learn to provide effective and subsecond control actions in regulating voltage profiles and reducing transmission losses.
A collection of optimization problems central to power system operation requires distributed solution architectures to avoid the need for aggregation of all information at a central location. In this paper, we study distributed dual subgradient metho
ds to solve three such optimization problems. Namely, these are tie-line scheduling in multi-area power systems, coordination of distributed energy resources in radial distribution networks, and joint dispatch of transmission and distribution assets. With suitable relaxations or approximations of the power flow equations, all three problems can be reduced to a multi-agent constrained convex optimization problem. We utilize a constant step-size dual subgradient method with averaging on these problems. For this algorithm, we provide a convergence guarantee that is shown to be order-optimal. We illustrate its application on the grid optimization problems.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
