References of "Capitanescu, Florin"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailA generic approach for solving nonlinear-discrete security-constrained power flow problems in large-scale systems
Platbrood, Ludovic; Capitanescu, Florin; Crisciu, Horia et al

in IEEE Transactions on Power Systems (in press)

This paper proves the practicality of an iterative algorithm for solving realistic large-scale SCOPF problems. This algorithm is based on the combination of a contingency filtering scheme, used to ... [more ▼]

This paper proves the practicality of an iterative algorithm for solving realistic large-scale SCOPF problems. This algorithm is based on the combination of a contingency filtering scheme, used to identify the binding contingencies at the optimum, and a network compression method, used to reduce the complexity of the post-contingency models included in the SCOPF formulation. We show that by combining these two complementary ideas, it is possible to solve in a reasonable time SCOPF problems on large power system models with a large number of contingencies. Unlike most results reported for large-scale SCOPF problems, our algorithm uses a non-linear AC network model in both pre-contingency and post-contingency states, optimizes both active/reactive powers flows jointly, and treats the discrete variables. The proposed algorithm is implemented with state-of-the-art solvers and applied to two systems: a national grid with 2563 buses and 1297 contingencies, and a model of the European transmission network with 9241 buses and 12000 contingencies. [less ▲]

Detailed reference viewed: 44 (6 ULg)
Full Text
Peer Reviewed
See detailComputation of worst operation scenarios under uncertainty for static security management
Capitanescu, Florin; Wehenkel, Louis ULg

in IEEE Transactions on Power Systems (2013), 28(2), 1697-1705

This paper deals with day-ahead static security assessment with respect to a postulated set of contingencies while taking into account uncertainties about the next day system conditions. We propose a ... [more ▼]

This paper deals with day-ahead static security assessment with respect to a postulated set of contingencies while taking into account uncertainties about the next day system conditions. We propose a heuristic approach to compute the worst-case under operation uncertainty for a contingency with respect to overloads. We formulate this problem as a non-convex nonlinear bilevel program that we solve approximately by a heuristic approach which relies on the solution of successive optimal power flow (OPF) and security-constrained optimal power flow (SCOPF) problems of a special type. The method aims at revealing those combinations of uncertainties and contingencies for which the best combination of preventive and corrective actions would not suffice to ensure security. Extensive numerical results on a small, a medium, and a very large system prove the interest of the approach. [less ▲]

Detailed reference viewed: 57 (9 ULg)
Full Text
Peer Reviewed
See detailContingency ranking with respect to overloads in very large power systems taking into account uncertainty, preventive, and corrective actions
Fliscounakis, Stéphane; Panciatici, Patrick; Capitanescu, Florin et al

in IEEE Transactions on Power Systems (2013)

This paper deals with day-ahead security management with respect to a postulated set of contingencies, while taking into account uncertainties about the next day generation/load scenario. In order to help ... [more ▼]

This paper deals with day-ahead security management with respect to a postulated set of contingencies, while taking into account uncertainties about the next day generation/load scenario. In order to help the system operator in decision making under uncertainty, we aim at ranking these contingencies into four clusters according to the type of control actions needed to cover the worst uncertainty pattern of each contingency with respect to branch overload. To this end we use a fixed point algorithm that loops over two main modules: a discrete bi-level program (BLV) that computes the worst-case scenario, and a special kind of security constrained optimal power flow (SCOPF) which computes optimal preventive/corrective actions to cover the worst-case. We rely on a DC grid model, as the large number of binary variables, the large size of the problem, and the stringent computational requirements preclude the use of existing mixed integer nonlinear programming (MINLP) solvers. Consequently we solve the SCOPF using a mixed integer linear programming (MILP) solver while the BLV is decomposed into a series of MILPs. We provide numerical results with our approach on a very large European system model with 9241 buses and 5126 contingencies. [less ▲]

Detailed reference viewed: 61 (8 ULg)
Full Text
Peer Reviewed
See detailExperiments with the interior-point method for solving large scale Optimal Power Flow problems
Capitanescu, Florin; Wehenkel, Louis ULg

in Electric Power Systems Research (2013), 95

This paper reports extensive results obtained with the interior-point method (IPM) for nonlinear programmes (NLPs) stemming from large-scale and severely constrained classical Optimal Power Flow (OPF) and ... [more ▼]

This paper reports extensive results obtained with the interior-point method (IPM) for nonlinear programmes (NLPs) stemming from large-scale and severely constrained classical Optimal Power Flow (OPF) and Security-Constrained Optimal Power Flow (SCOPF) problems. The paper discusses transparently the problems encountered such as convergence reliability and speed issues of the method. [less ▲]

Detailed reference viewed: 140 (5 ULg)