Noemi González-Cobos

Dr. Noemi González-Cobos

Instituto Tecnologico de la Energia
orcid

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
11 January 2018 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
NGNoemi González-Cobos
Noemi González-Cobos
JAJose M. Arroyo
Jose M. Arroyo
NANatalia Alguacil
Natalia Alguacil
JWJianhui Wang
Jianhui Wang
In the restructured power industry, bulk energy storage may play a crucial role to provide the flexibility required by system operators to cater for the unprecedented levels of uncertainty. Within the context of co-optimized electricity markets for energy and reserves under wind uncertainty, this paper addresses the incorporation of bulk energy storage units in day-ahead network-constrained energy and reserve scheduling. A novel two-stage robust optimization approach is presented whereby the nonconvex and time-coupled operation of storage devices is precisely modeled while accounting for the anticipativity of the two-stage setting. The resulting robust counterpart is cast as a mixed-integer trilevel program with lower-level binary variables. In order to address the nonconvexity of the recourse problem, this paper proposes the application of an exact nested column-and-constraint generation algorithm. Numerical results illustrate the effective performance of the proposed approach.

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.

12 November 2018 in IEEE Transactions on Sustainable Energy
Verified
Journal Article
Closed access
NGNoemi González-Cobos
Noemi González-Cobos
JAJose M. Arroyo
Jose M. Arroyo
NANatalia Alguacil
Natalia Alguacil
ASAlexandre Street
Alexandre Street
The large-scale integration of wind power generation has significantly boosted the role played by conventional fast-acting generating units in power system operation. Due to their short response time, these relatively expensive devices are particularly suited to cope with the intermittency and volatility featured by uncertain wind-based generation. Within the context of network-constrained generation scheduling under wind-related uncertainty, this paper presents a new robust approach wherein the operation of both slow- and fast-acting generating units is precisely characterized in a day-ahead co-optimized energy and reserve market. As salient modeling features, the ramping-related effect of dispatch nonanticipativity and nonspinning reserve offers are both accounted for. The resulting robust counterpart is formulated as a challenging trilevel program with lower-level binary variables that is effectively solved by an exact nested column-and-constraint generation algorithm. Numerical results including a practical out-of-sample validation procedure demonstrate the operational advantages and the computational effectiveness of the proposed approach.

1 December 2018 in Applied Energy
Verified
Journal Article
Closed access
NGNoemi González-Cobos
Noemi González-Cobos
JAJosé M. Arroyo
José M. Arroyo
NANatalia Alguacil
Natalia Alguacil
ASAlexandre Street
Alexandre Street

23 November 2016 in IEEE Transactions on Smart Grid
Verified
Journal Article
Closed access
NGNoemi González-Cobos
Noemi González-Cobos
JAJose M. Arroyo
Jose M. Arroyo
ASAlexandre Street
Alexandre Street
The relevant role played by the procurement of reserves becomes essential to hedge against the growing levels of penetration of intermittent wind-based generation. Within the context of unit-commitment-based day-ahead energy and reserve electricity markets, this paper proposes a novel approach for network-constrained energy and reserve scheduling based on adjustable robust optimization (ARO). Unlike previously reported generation scheduling models using ARO, offers for up- and down-spinning reserves and on/off generation statuses are explicitly considered in the problem formulation to jointly cope with uncertain nodal net injections and system component outages in a multiperiod setting. Moreover, the feasibility of the deployment of awarded reserve offers across the network is guaranteed at minimum offer cost. In other words, in contrast to current industry practice relying on deterministic models, the optimal scheduling of energy and reserve offers ensures power balance for all possible uncertainty realizations and credible contingencies. The proposed model is formulated as an instance of mixed-integer trilevel programming. The robust counterpart is effectively solved by a modified column-and-constraint generation algorithm featuring two novel acceleration strategies that improve the overall computational performance. Numerical simulations demonstrate the effectiveness of the proposed approach and its operational advantages over the conventional model relying on pre-specified reserve requirements.

1 September 2020 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
JAJose M. Arroyo
Jose M. Arroyo
Luis BaringoLuis Baringo
Luis Baringo
ABAna Baringo
Ana Baringo
RBRicardo Bolanos
Ricardo Bolanos
NANatalia Alguacil
Natalia Alguacil
NGNoemi González-Cobos
Noemi González-Cobos
Recently, several authors have reported specific criteria to support the widely accepted use of a convex operational model for bulk energy storage in the formulation of power system operation and planning problems involving binary variables. Using two counterexamples, we show that this modeling simplification may give rise to impractical solutions featuring simultaneous charging and discharging, even though the recently published criteria are satisfied. Thus, both counterexamples invalidate those criteria and demonstrate that the customarily used convex model may be unsuitable for the precise incorporation of bulk storage in such instances of mixed-integer programming.