اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدNatural Gas Maximal Load Delivery for Multi-contingency Analysis
51
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
As the use of renewable generation has increased, electric power systems have become increasingly reliant on natural gas-fired power plants as fast ramping sources for meeting fluctuating bulk power demands. This dependence has introduced new vulnerabilities to the power grid, including disruptions to gas transmission networks from natural and man-made disasters. To address the operational challenges arising from these disruptions, we consider the task of determining a feasible steady-state operating point for a damaged gas pipeline network while ensuring the maximal delivery of load. We formulate the mixed-integer nonconvex maximal load delivery (MLD) problem, which proves difficult to solve on large-scale networks. To address this challenge, we present a mixed-integer convex relaxation of the MLD problem and use it to determine bounds on the transport capacity of a gas pipeline system. To demonstrate the effectiveness of the relaxation, the exact and relaxed formulations are compared across a large number of randomized damage scenarios on nine natural gas pipeline network models ranging in size from 11 to 4197 junctions. A proof of concept application, which assumes network damage from a set of synthetically generated earthquakes, is also presented to demonstrate the utility of the proposed optimization-based capacity evaluation in the context of risk assessment for natural disasters. For all but the largest network, the relaxation-based method is found to be suitable for use in evaluating the impacts of multi-contingency network disruptions, often converging to the optimal solution of the relaxed formulation in less than ten seconds.
قيم البحث
اقرأ أيضاً
Recent increases in gas-fired power generation have engendered increased interdependencies between natural gas and power transmission systems. These interdependencies have amplified existing vulnerabilities to gas and power grids, where disruptions c
an require the curtailment of load in one or both systems. Although typically operated independently, coordination of these systems during severe disruptions can allow for targeted delivery to lifeline services, including gas delivery for residential heating and power delivery for critical facilities. To address the challenge of estimating maximum joint network capacities under such disruptions, we consider the task of determining feasible steady-state operating points for severely damaged systems while ensuring the maximal delivery of gas and power loads simultaneously, represented mathematically as the nonconvex joint Maximal Load Delivery (MLD) problem. To increase its tractability, we present a mixed-integer convex relaxation of the MLD problem. Then, to demonstrate the relaxations effectiveness in determining bounds on network capacities, exact and relaxed MLD formulations are compared across various multi-contingency scenarios on nine joint networks ranging in size from 25 to 1,191 nodes. The relaxation-based methodology is observed to accurately and efficiently estimate the impacts of severe joint network disruptions, often converging to the relaxed MLD problems globally optimal solution within ten seconds.
We consider the revenue management problem of finding profit-maximising prices for delivery time slots in the context of attended home delivery. This multi-stage optimal control problem admits a dynamic programming formulation that is intractable for
realistic problem sizes due to the so-called curse of dimensionality. Therefore, we study three approximate dynamic programming algorithms both from a control-theoretical perspective and in a parametric numerical case study. Our numerical analysis is based on real-world data, from which we generate multiple scenarios to stress-test the robustness of the pricing policies to errors in model parameter estimates. Our theoretical analysis and numerical benchmark tests show that one of these algorithms, namely gradient-bounded dynamic programming, dominates the others with respect to computation time and profit-generation capabilities of the delivery slot pricing policies that it generates. Finally, we show that uncertainty in the estimates of the model parameters further increases the profit-generation dominance of this approach.
Multi-modal delivery systems are a promising solution to the challenges posed by the increasing demand of e-commerce. Due to the potential benefit drones can have on logistics networks such as delivery systems, some countries have taken steps towards
integrating drones into their airspace. In this paper we aim to quantify this potential by developing a mathematical model for a multi-modal delivery system composed of trucks and drones. We propose an optimization formulation that can be efficiently solved in order to design socially-optimal routing and allocation policies. We incorporate both societal cost in terms of road congestion and parcel delivery latency in our formulation. Our model is able to quantify the effect drones have on mitigating road congestion, and can solve for the path routing needed to minimize the chosen objective. To accurately capture the effect of stopping trucks on road latency, we use SUMO simulations and derive a mathematical latency function for roads shared by trucks and cars. Based on this, we show that the proposed framework is computationally feasible to scale due to its reliance on convex quadratic optimization techniques.
Growing model complexities in load modeling have created high dimensionality in parameter estimations, and thereby substantially increasing associated computational costs. In this paper, a tensor-based method is proposed for identifying composite loa
d modeling (CLM) parameters and for conducting a global sensitivity analysis. Tensor format and Fokker-Planck equations are used to estimate the power output response of CLM in the context of simultaneously varying parameters under their full parameter distribution ranges. The proposed tensor structured is shown as effective for tackling high-dimensional parameter estimation and for improving computational performances in load modeling through global sensitivity analysis.
In this paper, a novel second-order method called NG+ is proposed. By following the rule ``the shape of the gradient equals the shape of the parameter, we define a generalized fisher information matrix (GFIM) using the products of gradients in the ma
trix form rather than the traditional vectorization. Then, our generalized natural gradient direction is simply the inverse of the GFIM multiplies the gradient in the matrix form. Moreover, the GFIM and its inverse keeps the same for multiple steps so that the computational cost can be controlled and is comparable with the first-order methods. A global convergence is established under some mild conditions and a regret bound is also given for the online learning setting. Numerical results on image classification with ResNet50, quantum chemistry modeling with Schnet, neural machine translation with Transformer and recommendation system with DLRM illustrate that GN+ is competitive with the state-of-the-art methods.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
