Tomas Tinoco De Rubira

Tomas Tinoco De Rubira

Auto-generated profile, based on publicly available information

Tomas Tinoco De Rubira

California Independent System Operator (CAISO), USA

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 December 2021 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
TITamer M. Sobhy Ibrahim
Tamer M. Sobhy Ibrahim
TRTomas Tinoco De Rubira
Tomas Tinoco De Rubira
ARAlberto Del Rosso
Alberto Del Rosso
MPMahendra Patel
Mahendra Patel
SGSwaroop Guggilam
Swaroop Guggilam
AMAhmed A. Mohamed
Ahmed A. Mohamed
This paper proposes an optimization approach for day-ahead reactive power planning to improve voltage security in transmission networks. The problem is formulated as a voltage secure multi-period optimal reactive power dispatch (MP-ORPD) problem. The optimization approach searches for optimal setpoints of dynamic and static reactive power (var) resources. Specifically, the output includes set-points for switching shunts, transformer taps, and voltage magnitudes at the regulated buses. The primary goal is to maximize the dynamic reactive power reserve of the system, by minimizing the reactive power supplied by synchronous generators. As the size of the MP-ORPD problem increases significantly with increasing number of contingencies and time periods, efficiency is crucial for practical applications. In this paper, a decomposition technique based on consensus and alternating optimization, where integer variable targets are obtained via MILP, is used to partition the MP-ORPD problem into a set of subproblems, which can be solved in parallel to reduce the computation time. The proposed MP-ORPD problem and its solution algorithm are integrated into the EPRIVCA software. The results of various power networks of large electric utilities in the Eastern interconnection demonstrate the effectiveness of the proposed algorithm in providing preventive control schedules.

14 March 2019 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
DSDmitry Shchetinin
Dmitry Shchetinin
TRTomas Tinoco De Rubira
Tomas Tinoco De Rubira
GHGabriela Hug
Gabriela Hug
Convex relaxations of the ac optimal power flow problem in certain cases can recover a globally optimal point of the original problem. However, in general their solutions are not guaranteed to be physically meaningful. While the relaxation quality can be improved by enforcing tighter bounds on variables, existing bound tightening methods do not scale well with grid size. This paper presents three methods for tightening bounds on branch angle differences that complement each other and are highly parallelizable. The proposed methods are computationally efficient even for large-scale grids and thus can be used as a preprocessing step before solving the convex relaxation of the optimal power flow problem. Numerical experiments demonstrate that these methods can significantly tighten most of the bounds in a fraction of the time required to solve the convex relaxation. In addition, the experimental results show that tighter bounds improve the relaxation quality and reduce the optimality gap for large-scale instances.

4 October 2018 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
DSDmitry Shchetinin
Dmitry Shchetinin
TRTomas Tinoco De Rubira
Tomas Tinoco De Rubira
GHGabriela Hug
Gabriela Hug
The AC optimal power flow problem is a non-convex optimization problem that is difficult to solve quickly and reliably for large-scale grids. While various approximations have been proposed, they may lead to physically meaningless solutions. This paper presents a computationally efficient algorithm for constructing accurate linear approximations of line flow constraints. These approximations reduce the complexity of the optimization problem while ensuring that the solution is physically meaningful and has a high quality. The algorithm is based on an in-depth analysis of the feasible set of the line flow constraint. Numerical experiments are performed on ten large-scale systems using three nonlinear programming solvers. Obtained results indicate that the proposed formulation helps improve the solvers' reliability and reduce the computation time for hard large-scale problems. At the same time, the developed algorithm provides high quality approximations of the line flow constraints.