Search

The integration of wind power requires the power system to be sufficiently flexible to accommodate its forecast errors. In the market clearing process, the scheduling of flexibility relies on the manner in which the wind power uncertainty is addressed in the unit commitment (UC) model. This paper presents a novel risk-based day-ahead unit commitment (RUC) model that considers the risks of the loss of load, wind curtailment and branch overflow caused by wind power uncertainty. These risks are formulated in detail using the probabilistic distributions of wind power probabilistic forecast and are considered in both the objective functions and the constraints. The RUC model is shown to be convex and is transformed into a mixed integer linear programming (MILP) problem using relaxation and piecewise linearization. The proposed RUC model is tested using a three-bus system and an IEEE RTS79 system with wind power integration. The results show that the model can dynamically schedule the spinning reserves and hold the transmission capacity margins according to the uncertainty of the wind power. A comparison between the results of the RUC, a deterministic UC and two scenario-based UC models shows that the risk modeling facilitates a strategic market clearing procedure with a reasonable computational expense. [ABSTRACT FROM PUBLISHER]

Composite power system reliability evaluation is computationally time-consuming because the optimal power flow (OPF) with the least load curtailment is calculated for a large number of samples. Most current studies of probabilistic simulation methods focus on sampling techniques to improve the sampling efficiency and decrease the calculations of the OPF. This paper proposes a fast reliability evaluation method that accelerates the calculation of the OPF using multi-parametric linear programming (MPLP). In this paper, the sampled transmission line statuses are considered by the transmission line status dictionary (TLSD). We match the line status of each sample with the scenarios in the TLSD. For matching samples, the generation status and the sampled load are treated as MPLP parameters of the DC-OPF evaluation model. A dynamic learning algorithm is applied to solve the MPLP problem. Case studies are conducted on both IEEE Reliability Test Systems and a provincial power system in China. The results show that the proposed method improves the evaluation efficiency by 23–30 times compared with the normal DC-OPF-based model. [ABSTRACT FROM AUTHOR]

This paper introduces a dynamic multiplier-based Lagrangian relaxation approach for the solution to multi-area economic dispatch (MAED) in a fully decentralized manner. Dynamic multipliers refer to the multipliers associated with power balance equations at tie-line buses in each area. Dynamic multipliers can be approximated as linear functions of tie-line power exports via sensitivity analysis and can serve as the equivalent supply/demand functions to neighboring areas. In contrast to the conventional static point-wise multiplier, which is unable to reflect the marginal cost change that results from variations in the power exchange level, the proposed dynamic multiplier provides each area the look-ahead capability to foresee the range of the marginal cost for power export over a range of tie-line exchange variations. In turn, this allows for a significantly faster convergence to the global optimal solution. The algorithm is also shown to be early termination friendly, which is very desirable in practice for ultra-large systems such as the State Grid of China. Numerical examples in a 6-bus system, a 3-area 354-bus IEEE system, and large test systems illustrate the benefits of the proposed algorithm. [ABSTRACT FROM PUBLISHER]