اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCommitment and Dispatch of Heat and Power Units via Affinely Adjustable Robust Optimization
40
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The joint management of heat and power systems is believed to be key to the integration of renewables into energy systems with a large penetration of district heating. Determining the day-ahead unit commitment and production schedules for these systems is an optimization problem subject to uncertainty stemming from the unpredictability of demand and prices for heat and electricity. Furthermore, owing to the dynamic features of production and heat storage units as well as to the length and granularity of the optimization horizon (e.g., one whole day with hourly resolution), this problem is in essence a multi-stage one. We propose a formulation based on robust optimization where recourse decisions are approximated as linear or piecewise-linear functions of the uncertain parameters. This approach allows for a rigorous modeling of the uncertainty in multi-stage decision-making without compromising computational tractability. We perform an extensive numerical study based on data from the Copenhagen area in Denmark, which highlights important features of the proposed model. Firstly, we illustrate commitment and dispatch choices that increase conservativeness in the robust optimization approach. Secondly, we appraise the gain obtained by switching from linear to piecewise-linear decision rules within robust optimization. Furthermore, we give directions for selecting the parameters defining the uncertainty set (size, budget) and assess the resulting trade-off between average profit and conservativeness of the solution. Finally, we perform a thorough comparison with competing models based on deterministic optimization and stochastic programming.
قيم البحث
اقرأ أيضاً
The correlations of multiple renewable power plants (RPPs) should be fully considered in the power system with very high penetration renewable power integration. This paper models the uncertainties, spatial correlation of multiple RPPs based on Copul
a theory and actual probability historical histograms by one-dimension distributions for economic dispatch (ED) problem. An efficient dynamic renewable power scenario generation method based on Gibbs sampling is proposed to generate renewable power scenarios considering the uncertainties, spatial correlation and variability (temporal correlation) of multiple RPPs, in which the sampling space complexity do not increase with the number of RPPs. Distribution-based and scenario-based methods are proposed and compared to solve the real-time ED problem with multiple RPPs. Results show that the proposed dynamic scenario generation method is much more consist with the actual renewable power. The proposed ED methods show better understanding for the uncertainties, spatial and temporal correlations of renewable power and more economical compared with the traditional ones.
The increasing penetration of distributed energy resources (DERs) in the distribution networks has turned the conventionally passive load buses into active buses that can provide grid services for the transmission system. To take advantage of the DER
s in the distribution networks, this letter formulates a transmission-and-distribution (T&D) systems co-optimization problem that achieves economic dispatch at the transmission level and optimal voltage regulation at the distribution level by leveraging large generators and DERs. A primal-dual gradient algorithm is proposed to solve this optimization problem jointly for T&D systems, and a distributed market-based equivalent of the gradient algorithm is used for practical implementation. The results are corroborated by numerical examples with the IEEE 39-Bus system connected with 7 different distribution networks.
We study the problem of policy synthesis for uncertain partially observable Markov decision processes (uPOMDPs). The transition probability function of uPOMDPs is only known to belong to a so-called uncertainty set, for instance in the form of probab
ility intervals. Such a model arises when, for example, an agent operates under information limitation due to imperfect knowledge about the accuracy of its sensors. The goal is to compute a policy for the agent that is robust against all possible probability distributions within the uncertainty set. In particular, we are interested in a policy that robustly ensures the satisfaction of temporal logic and expected reward specifications. We state the underlying optimization problem as a semi-infinite quadratically-constrained quadratic program (QCQP), which has finitely many variables and infinitely many constraints. Since QCQPs are non-convex in general and practically infeasible to solve, we resort to the so-called convex-concave procedure to convexify the QCQP. Even though convex, the resulting optimization problem still has infinitely many constraints and is NP-hard. For uncertainty sets that form convex polytopes, we provide a transformation of the problem to a convex QCQP with finitely many constraints. We demonstrate the feasibility of our approach by means of several case studies that highlight typical bottlenecks for our problem. In particular, we show that we are able to solve benchmarks with hundreds of thousands of states, hundreds of different observations, and we investigate the effect of different levels of uncertainty in the models.
The stochastic and dynamic nature of renewable energy sources and power electronic devices are creating unique challenges for modern power systems. One such challenge is that the conventional mathematical systems models-based optimal active power dis
patch (OAPD) method is limited in its ability to handle uncertainties caused by renewables and other system contingencies. In this paper, a deep reinforcement learning-based (DRL) method is presented to provide a near-optimal solution to the OAPD problem without system modeling. The DRL agent undergoes offline training, based on which, it is able to obtain the OAPD points under unseen scenarios, e.g., different load patterns. The DRL-based OAPD method is tested on the IEEE 14-bus system, thereby validating its feasibility to solve the OAPD problem. Its utility is further confirmed in that it can be leveraged as a key component for solving future model-free AC-OPF problems.
Repair crews (RCs) and mobile power sources (MPSs) are critical resources for distribution system (DS) outage management after a natural disaster. However, their logistics is not well investigated. We propose a resilient scheme for disaster recovery
logistics to co-optimize DS restoration with dispatch of RCs and MPSs. A novel co-optimization model is formulated to route RCs and MPSs in the transportation network, schedule them in the DS, and reconfigure the DS for microgrid formation coordinately, etc. The model incorporates different timescales of DS restoration and RC/MPS dispatch, the coupling of transportation and power networks, etc. To ensure radiality of the DS with variable physical structure and MPS allocation, we also model topology constraints based on the concept of spanning forest. The model is convexified equivalently and linearized into a mixed-integer linear programming. To reduce its computation time, preprocessing methods are proposed to pre-assign a minimal set of repair tasks to depots and reduce the number of candidate nodes for MPS connection. Resilient recovery strategies thus are generated to enhance service restoration, especially by dynamic formation of microgrids that are powered by MPSs and topologized by repair actions of RCs and network reconfiguration of the DS. Case studies demonstrate the proposed methodology.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
