اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Novel Projected Two Binary Variables Formulation for Unit Commitment Problem
144
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The thermal unit commitment (UC) problem often can be formulated as a mixed integer quadratic programming (MIQP), which is difficult to solve efficiently, especially for large-scale instances. In this paper, with projecting unit generation level onto [0,1] and reformulation techniques, a novel two binary (2-bin) variables MIQP formulation for UC problem is presented. We show that 2-bin formulation is more compact than the state-of-the-art one binary (1-bin) variable formulation and three binary (3-bin) variables formulation. Moreover, 2-bin formulation is tighter than 1-bin and 3-bin formulations in quadratic cost function, and it is tighter than 1-bin formulation in linear constraints. Three mixed integer linear programming (MILP) formulations can be obtained from three UC MIQPs by replacing the quadratic terms in the objective functions by a sequence of piece-wise perspective-cuts. 2-bin MILP is also the best one due to the similar reasons of MIQP. The simulation results for realistic instances that range in size from 10 to 200 units over a scheduling period of 24 hours show that the proposed 2-bin formulations are competitive with currently state-of-the-art formulations and promising for large-scale UC problems.
قيم البحث
اقرأ أيضاً
This paper proposes a global optimization method for it ensures finding good solutions while solving the unit commitment (UC) problem with carbon emission trading (CET). This method con-sists of two parts. In the first part, a sequence of linear inte
-ger-relaxed subproblems are first solved to rapidly generate a tight linear relaxation of the original mixed integer nonlinear pro-gramming problem (MINLP) model. In the second part, the algo-rithm introduces the idea of center-cut so that it can quickly find good solutions. The approach tested on 10 test instances with units ranging from 35 to 1560 over a scheduling period of 24h, and compared with state-of-the-art solver CPLEX. The results show that the proposed algorithm can find better solutions than CPLEX in a short time. And it is more suitable to solve large scale UC problem than CPLEX.
This paper proposes a Clustered Unit Commitment (CUC) formulation to accurately model flexibility requirements such as ramping, reserve, and startup/shutdown constraints. The CUC is commonly applied in large and long-term planning models to approxima
te the units operational flexibility in power systems due to its computational advantages. However, the classic CUC intrinsically and hiddenly overestimates the individual units flexibility, thus being unable to replicate the result of the individual UC. This paper then present a set of constraints to correctly represent the units hidden flexibility within the cluster, mainly defined by the individual units ramping and startup/shutdown capabilities, including up/down reserves. Different case studies show that the proposed CUC replicates the objective function of the individual UC while solving significantly faster, between 5 to 311 times faster. Therefore, the proposed CUC correctly represents the individual units ramping and reserve flexibility within the cluster and could be directly applied to long-term planning models without significantly increasing their computational burden.
In Part I of this paper we have introduced the closed-form conditions for guaranteeing regional frequency stability in a power system. Here we propose a methodology to represent these conditions in the form of linear constraints and demonstrate their
applicability by implementing them in a generation-scheduling model. This model simultaneously optimises energy production and ancillary services for maintaining frequency stability in the event of a generation outage, by solving a frequency-secured Stochastic Unit Commitment (SUC). We consider the Great Britain system, characterised by two regions that create a non-uniform distribution of inertia: England in the South, where most of the load is located, and Scotland in the North, containing significant wind resources. Through several case studies, it is shown that inertia and frequency response cannot be considered as system-wide magnitudes in power systems that exhibit inter-area oscillations in frequency, as their location in a particular region is key to guarantee stability. In addition, securing against a medium-sized loss in the low-inertia region proves to cause significant wind curtailment, which could be alleviated through reinforced transmission corridors. In this context, the proposed constraints allow to find the optimal volume of ancillary services to be procured in each region.
We introduce a novel evolutionary formulation of the problem of finding a maximum independent set of a graph. The new formulation is based on the relationship that exists between a graphs independence number and its acyclic orientations. It views suc
h orientations as individuals and evolves them with the aid of evolutionary operators that are very heavily based on the structure of the graph and its acyclic orientations. The resulting heuristic has been tested on some of the Second DIMACS Implementation Challenge benchmark graphs, and has been found to be competitive when compared to several of the other heuristics that have also been tested on those graphs.
We devise the Unit Commitment Nearest Neighbor (UCNN) algorithm to be used as a proxy for quickly approximating outcomes of short-term decisions, to make tractable hierarchical long-term assessment and planning for large power systems. Experimental results on updat
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
