29 January 2018 in IEEE Transactions on Smart Grid
Collaborative operation of electricity transmission and distribution systems improves the economy and reliability of the entire power system. However, this is a challenging problem given that transmission system operators (TSOs) and distribution system operators (DSOs) are autonomous entities that are unwilling to reveal their commercially sensitive information. This paper presents a decentralized decision-making algorithm for collaborative TSO+DSO optimal power flow (OPF) implementation. The proposed algorithm is based on analytical target cascading (ATC) for multilevel hierarchical optimization in complex engineering systems. A local OPF is formulated for each TSO/DSO taking into consideration interactions between the transmission and distribution systems while respecting autonomy and information privacy of TSO and DSOs. The local OPF of TSO is solved in the upper-level of hierarchy, and the local OPFs of DSOs are handled in the lower-level. A diagonal quadratic approximation (DQA) and a truncated diagonal quadratic approximation (TDQA) are presented to develop iterative coordination strategies in which all local OPFs are solved in a parallel manner with no need for a central coordinator. This parallel implementation significantly enhances computations efficiency of the algorithm. The proposed collaborative TSO+DSO OPF is evaluated using a 6-bus and the IEEE 118-bus test systems, and promising results are obtained.
27 December 2017 in IEEE Transactions on Power Systems
This paper presents a decentralized solution algorithm for network-constrained unit commitment (NCUC) in multiregional power systems. The proposed algorithm is based on our previous work in which a local NCUC was formulated for each control entity (i.e., region) and an analytical target cascading (ATC) based distributed but partially parallelized algorithm requiring a central coordinator was presented. The primary objective of this paper is to present a decentralized approach that relaxes the need for any form of central coordinator in ATC and allows fully parallelized solutions of the local NCUCs. To achieve this objective, we formulate a bilevel optimization problem for each control entity. While the upper level solves the NCUC problem of the control entity, the lower level seeks to coordinate the control entity with its neighboring regions. The lower level is a convex optimization, which can be further replaced in the upper level problem by the Karush-Kuhn-Tucker conditions. The control entities communicate directly with each other and synchronously solve their local NCUCs. Having no need for any form of central coordinator, the proposed algorithm is potentially less vulnerable to cyber-attacks and communication failures than the distributed methods utilizing a coordinator.
8 September 2020 in IEEE Transactions on Industry Applications
An important focus of the energy strategy of the European Union relies on the concept of zero energy building, which is by definition a building that roughly produces yearly as much renewable energy as it consumes. This paper proposes an enhanced mixed-integer nonlinear programming model for optimal sizing of photovoltaic and battery energy storage systems to comply with the definition of a zero energy building. A salient novel feature of the proposed model is that it factors in the environmental impacts, computed through rigorous life cycle assessment methodology, of buying electricity from the grid and manufacturing battery and photovoltaic systems. Furthermore, an adjustable parameter is introduced to make the model adaptive from the perspective of the building owner's willingness-to-pay for environmental impacts. The proposed model is then carefully reformulated, managing to accumulate its nonlinearity in only one constraint per time interval. Eventually, the reformulated model is linearized to a mixed-integer linear programming model using McCormick relaxation technique. The case study conducted on an archetypal building in Luxembourg reveal that the proposed McCormick-based linear model is able to provide high accuracy results with reasonable computational effort.
31 July 2019 in IEEE Transactions on Industrial Informatics
This paper presents a data-driven nonparametric chance-constrained optimization for microgrid energy management. The proposed approach imposes no assumption on probability density and distribution functions of solar generation and load. Adaptive kernel density estimator is utilized to construct a confidence set for each random parameter based on historical data. The constructed confidence sets encompass the ambiguous true distribution and density functions (PDFs). The concept of phi-divergence tolerance is applied to compute the distance between estimated and true PDFs. The estimated distributions are used to formulate a set of data-driven nonparametric chance constraints and model system/component restrictions. To account for the impact of errors in the forecast distributions on system economics and security, confidence levels of the chance constraints are adjusted with respect to point-wise errors of the estimated PDFs. This adjustment ensures that the microgrid chance constraints are satisfied with a predetermined confidence level even if the true realizations of solar generation and load do not exactly fit on the estimated PDFs. The chance constraints are converted into algebraic constraints. Numerical results show the effectiveness of the proposed approach for microgrid management.
24 June 2023 in Renewable and Sustainable Energy Reviews
2 June 2021 in IEEE Transactions on Power Systems
To design a reliable and secure power system, it is necessary to have enough transmission capacity. The solution of transmission expansion planning (TEP) problem determines cost-optimal investment in future transmission equipment. In this paper, we propose a new global solver, named Global-TEP, for the TEP problem with an AC network representation (ACTEP), which is a mixed-integer nonlinear programming problem. The proposed solver is based on second-order cone relaxation, enhanced relaxation tightening constraints, and optimization-based/feasibility-based bound tightening techniques. Multiple enhanced relaxation tightening constraints are incorporated into the mixed-integer second-order cone relaxation of TEP in order to obtain a very strong relaxation as the lower bounding problem. In addition, a novel feasibility-based bound tightening technique is proposed to tighten the bounds of decision variables in a considerably short runtime. Finally, introducing a novel application of optimization-based bound tightening technique, Global-TEP is constructed that can solve the ACTEP problem efficiently with a guaranteed optimality gap. As illustrated by numerical case studies, Global-TEP is more scalable, more flexible, and much faster than the available global solvers.