Alexandre Velloso

Alexandre Velloso

Auto-generated profile, based on publicly available information

Alexandre Velloso

School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
25 January 2021 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
AVAlexandre Velloso
Alexandre Velloso
PHPascal Van Hentenryck
Pascal Van Hentenryck
The security-constrained optimal power flow (SCOPF) is fundamental in power systems and connects the automatic primary response (APR) of synchronized generators with the short-term schedule. Every day, the SCOPF problem is repeatedly solved for various inputs to determine robust schedules given a set of contingencies. Unfortunately, the modeling of APR within the SCOPF problem results in complex large-scale mixed-integer programs, which are hard to solve. To address this challenge, leveraging the wealth of available historical data, this paper proposes a novel approach that combines deep learning and robust optimization techniques. Unlike recent machine-learning applications where the aim is to mitigate the computational burden of exact solvers, the proposed method predicts directly the SCOPF implementable solution. Feasibility is enforced in two steps. First, during training, a Lagrangian dual method penalizes violations of physical and operations constraints, which are iteratively added as necessary to the machine-learning model by a Column-and-Constraint-Generation Algorithm (CCGA). Second, another different CCGA restores feasibility by finding the closest feasible solution to the prediction. Experiments on large test cases show that the method results in significant time reduction for obtaining feasible solutions with an optimality gap below 0.1%.

6 May 2019 in IEEE Transactions on Sustainable Energy
Verified
Journal Article
Closed access
AVAlexandre Velloso
Alexandre Velloso
ASAlexandre Street
Alexandre Street
DPDavid Pozo
David Pozo
JAJose M. Arroyo
Jose M. Arroyo
NGNoemi González-Cobos
Noemi González-Cobos
Two-stage robust unit commitment (RUC) models have been widely used for day-ahead energy and reserve scheduling under high renewable integration. The current state of the art relies on budget-constrained polyhedral uncertainty sets to control the conservativeness of the solutions. The associated lack of interpretability and parameter specification procedures, as well as the high computational burden exhibited by available exact solution techniques call for new approaches. In this paper, we use an alternative scenario-based framework whereby uncertain renewable generation is characterized by a polyhedral uncertainty set relying on the direct specification of its vertexes. Moreover, we present a simple, yet efficient, adaptive data-driven procedure to dynamically update the uncertainty set vertexes with observed daily renewable-output profiles. Within this setting, the proposed data-driven RUC ensures protection against the convex hull of realistic scenarios empirically capturing the complex and time-varying intra-day spatial and temporal interdependencies among renewable units. The resulting counterpart features advantageous properties from a computational perspective and can be effectively solved by the column-and-constraint generation algorithm until ε-global optimality. Out-of-sample experiments reveal that the proposed approach is capable of attaining efficient solutions in terms of cost and robustness while keeping the model tractable and scalable.

9 March 2020 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
AVAlexandre Velloso
Alexandre Velloso
DPDavid Pozo
David Pozo
ASAlexandre Street
Alexandre Street
We present a distributionally robust optimization (DRO) approach for the transmission expansion planning problem, considering both long- and short-term uncertainties on the system demand and non-dispatchable renewable generation. On the long-term level, as is customary in industry applications, we address the deep uncertainties arising from social and economic transformations, political and environmental issues, and technology disruptions by using long-term scenarios devised by experts. In this setting, many exogenous long-term scenarios containing partial information about the random parameters, namely, the average and the support set, can be considered. For each long-term scenario, a conditional ambiguity set models the incomplete knowledge about the probability distribution of the uncertain parameters in the short-term operation. Consequently, the mathematical problem is formulated as a DRO model with multiple conditional ambiguity sets. The resulting infinite-dimensional problem is recast as an exact, although very large, finite mixed-integer linear programming problem. To circumvent scalability issues, we propose a new enhanced-column-and-constraint-generation (ECCG) decomposition approach with an additional Dantzig-Wolfe procedure. In comparison to existing methods, ECCG leads to a better representation of the recourse function and, consequently, tighter bounds. Numerical experiments based on the benchmark IEEE 118-bus system are reported to corroborate the effectiveness of the method.

1 June 2021 in Electric Power Systems Research
Verified
Journal Article
Closed access
AVAlexandre Velloso
Alexandre Velloso
PHPascal Van Hentenryck
Pascal Van Hentenryck
EJEmma S. Johnson
Emma S. Johnson