Abstract-The recent increase in the deployment of renewable energy sources may affect the offering strategy of conventional producers, mainly in the balancing market. The topics of optimal offering strategy and self-scheduling of thermal units have been extensively addressed in the literature. The feasible operating region of such units can be modeled using a mixed-integer linear programming approach, and the trading problem as a linear programming problem. However, the existing models mostly assume a uniform pricing scheme in all market stages, while several European balancing markets (e.g., in Germany and Italy) are settled under a pay-as-bid pricing scheme. The existing tools for solving the trading problem in pay-as-bid electricity markets rely on non-linear optimization models, which, combined with the unit commitment constraints, result in a mixed-integer non-linear programming problem. In contrast, we provide a linear formulation for that trading problem. Then, we extend the proposed approach by formulating a two-stage stochastic problem for optimal offering in a two-settlement electricity market with a pay-as-bid pricing scheme at the balancing stage. The resulting model is mixed-integer and linear. The proposed model is tested on a realistic case study against a sequential offering approach, showing the capability of increasing profits in expectation.
This paper proposes an algorithm to efficiently solve large optimization problems which exhibit a column bounded block-diagonal structure, where subproblems differ in right-hand side and cost coefficients. Similar problems are often tackled using cutting-plane algorithms, which allow for an iterative and decomposed solution of the problem. When solving subproblems is computationally expensive and the set of subproblems is large, cutting-plane algorithms may slow down severely. In this context we propose two novel adaptive oracles that yield inexact information, potentially much faster than solving the subproblem. The first adaptive oracle is used to generate inexact but valid cutting planes, and the second adaptive oracle gives a valid upper bound of the true optimal objective. These two oracles progressively “adapt” towards the true exact oracle if provided with an increasing number of exact solutions, stored throughout the iterations. These adaptive oracles are embedded within a Benders-type algorithm able to handle inexact information. We compare the Benders with adaptive oracles against a standard Benders algorithm on a stochastic investment planning problem. The proposed algorithm shows the capability to substantially reduce the computational effort to obtain an $$\epsilon $$ ϵ -optimal solution: an illustrative case is 31.9 times faster for a $$1.00\%$$ 1.00 % convergence tolerance and 15.4 times faster for a $$0.01\%$$ 0.01 % tolerance.
In electricity markets with a dual-pricing scheme for balancing energy, controllable production units typically participate in the balancing market as "active" actors by offering regulating energy to the system, while renewable stochastic units are treated as "passive" participants that create imbalances and are subject to less competitive prices. Against this background, we propose an innovative market framework whereby the participant in the balancing market is allowed to act as an active agent (i.e., a provider of regulating energy) in some trading intervals and as a passive agent (i.e., a user of regulating energy) in some others. To illustrate and evaluate the proposed market framework, we consider the case of a virtual power plant (VPP) that trades in a two-settlement electricity market composed of a day-ahead and a dual-price balancing market. We formulate the optimal market offering problem of the VPP as a threestage stochastic program, where uncertainty is in the day-ahead electricity prices, balancing prices and the power output from the renewable units. Computational experiments show that the VPP expected revenues can increase substantially compared to an active-only or passive-only participation, and in the paper we discuss how the variability of the stochastic sources affects the balancing market participation choice.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.