Global Solution Strategies for the Network-Constrained Unit Commitment Problem With AC Transmission Constraints

Liu, Jianfeng; Laird, Carl D.; Scott, Joseph K.; Watson, Jean‐Paul; Castillo, Anya

doi:10.1109/tpwrs.2018.2876127

Cited by 39 publications

(17 citation statements)

References 57 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Multi-tree solution strategies such as Generalized Benders Decomposition [14] and Outer Approximation (OA) [15] are effective for convex problems and have been applied to a nonconvex MINLP problem. For example, the OA has been applied to the unit commitment problem with AC constraints [16], [17].…”

Section: Introductionmentioning

confidence: 99%

Optimal Network Topology for Node-Breaker Representations With AC Power Flow Constraints

Park

DeMarco

2020

IEEE Access

View full text Add to dashboard Cite

It has been demonstrated that network topology optimization (NTO) may change the topology of power system networks, and consequently, provide additional flexibility to reduce network congestion and violations. Most NTO problems are formulated based on the bus-branch model in which it is challenging to represent a realistic picture of all substation configurations. In this paper, we explore advantages of substation reconfiguration modeling based on node-breaker representations for NTO problem with full nonlinear alternating current power flow. It also proposes a tailored solution algorithm to solve this nonconvex mixedinteger nonlinear programming through the outer approximation method. The proposed solution approach iterates between a mixed-integer linear programming and a nonlinear subproblem. Additional enhancements to further accelerate the iteration process are illustrated. Numerical case studies demonstrate the relative economic and operational impact of optimal network topology with node-breaker representations.

show abstract

Section: Introductionmentioning

confidence: 99%

Optimal Network Topology for Node-Breaker Representations With AC Power Flow Constraints

Park

DeMarco

2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…The UC problem in the presence of renewable energy sources (RESs) has been investigated in Nikzad et al Several methods applied to solve the UC such as robust optimization, information gap decision theory, and Taguchi orthogonal array technique as well as their advantages and drawbacks are described the paper. A novel global solution algorithm has been proposed for the network‐constrained UC problem that incorporates a nonlinear alternating current model of the transmission network, which is a nonconvex mixed‐integer nonlinear programming problem . A data‐driven stochastic optimization is employed to solve the security‐constrained UC model to incorporate the superiority of both stochastic and robust approaches .…”

Section: Introductionmentioning

confidence: 99%

“…A novel global solution algorithm has been proposed for the network-constrained UC problem that incorporates a nonlinear alternating current model of the transmission network, which is a nonconvex mixed-integer nonlinear programming problem. 40 A data-driven stochastic optimization is employed to solve the security-constrained UC model to incorporate the superiority of both stochastic and robust approaches. 41 This approach makes the most use of the historical data to generate a set of possible probability distributions for wind power outputs and then it optimizes the UC under the worst-case probability distribution.…”

Section: Introductionmentioning

confidence: 99%

A joint energy and reserve scheduling framework based on network reliability using smart grids applications

Ansari

Malekshah

2019

Int Trans Electr Energ Syst

View full text Add to dashboard Cite

Summary This paper presents a new method based on a probabilistic scheduling reserve for smart grids, which include renewable energy sources (RESs), thermal units, and energy storage systems (ESSs). The method is divided into two main parts. The first part is based on spinning reserve to overcome the load‐generation imbalance in the network, while the second part is related to the spinning reserve for the outage of generation units. The total expected energy not supplied (TEENS) is the reliability criterion that determines the required spinning reserve. In the proposed formulation, generation units, the demand response (DR) program, and ESSs are capable of providing both types of reserves. The proposed method is evaluated using The Institute of Electrical and Electronics Engineers (IEEE) standard 30‐bus and IEEE reliability test networks. The suggested structure has been implemented by General Algebraic Modeling System (GAMS), and the results indicate the appropriate performance of the proposed method.

show abstract

“…For a stochastic SCUC problem with wind power volatility, Lagrangian relaxation is applied for parallel computation, but the original nonlinear model is piece-wise linearized, and the iteration process is still burdensome [8]. To guarantee the global solution at convergence, in [9], optimization-based bounds tightening, second-order cone relaxations, and piece-wise outer approximations are leveraged. Though the ACPF model is more accurate, the constraints are non-convex and nonlinear, and therefore the computation burden and complexity are extremely high when applied to the large-scale grids.…”

Section: Introductionmentioning

confidence: 99%

A Mixed-Integer Convex Programming Algorithm for Security-Constrained Unit Commitment of Power System with 110-kV Network and Pumped-Storage Hydro Units

Lin

Fan

et al. 2019

Energies

View full text Add to dashboard Cite

The secure operation of 110-kV networks should be considered in the optimal generation dispatch of regional power grids in large central cities. However, since 110-kV lines do not satisfy the premise of R << X in the direct current power flow (DCPF) model, the DCPF, which is mostly applied in the security-constrained unit commitment (SCUC) problem of high-voltage power grids, is no longer suitable for describing the active power flow of regional power grids in large central cities. Hence, the quadratic active power flow (QAPF) model considering the resistance of lines is proposed to describe the network security constraints, and an SCUC model for power system with 110-kV network and pumped-storage hydro (PSH) units is established. The analytical expressions of the spinning reserve (SR) capacity of PSH units are given considering different operational modes, and the SR capacity of PSH units is included in the constraint of the SR capacity requirement of the system. The QAPF is a set of quadratic equality constraints, making the SCUC model a mixed-integer nonlinear non-convex programming (MINNP) model. To reduce the computational complexity of solving the model when applied in actual large-scale regional networks, the QAPF model is relaxed by its convex hull, and the SCUC model is transformed into a mixed-integer convex programming (MICP) model, which can be solved to obtain the global optimal solution efficiently and reliably by the mature commercial solver GUROBI (24.3.3, GAMS Development Corporation, Guangzhou, China). Test results on the IEEE-9 bus system, the PEGASE 89 bus system and the Shenzhen city power grid including the 110-kV network demonstrate that the relaxed QAPF model has good calculation accuracy and efficiency, and it is suitable for solving the SCUC problem in large-scale regional networks.

show abstract

Global Solution Strategies for the Network-Constrained Unit Commitment Problem With AC Transmission Constraints

Cited by 39 publications

References 57 publications

Optimal Network Topology for Node-Breaker Representations With AC Power Flow Constraints

Optimal Network Topology for Node-Breaker Representations With AC Power Flow Constraints

A joint energy and reserve scheduling framework based on network reliability using smart grids applications

A Mixed-Integer Convex Programming Algorithm for Security-Constrained Unit Commitment of Power System with 110-kV Network and Pumped-Storage Hydro Units

Contact Info

Product

Resources

About