Uncertainty in distributed renewable generation threatens the security of power distribution systems.The concept of dispatchable region is developed to assess the ability of power systems to accommodate renewable gene...Uncertainty in distributed renewable generation threatens the security of power distribution systems.The concept of dispatchable region is developed to assess the ability of power systems to accommodate renewable generation at a given operating point.Although DC and linearized AC power flow equations are typically used to model dispatchable regions for transmission systems,these equations are rarely suitable for distribution networks.To achieve a suitable trade-off between accuracy and efficiency,this paper proposes a dispatchable region formulation for distribution networks using tight convex relaxation.Secondorder cone relaxation is adopted to reformulate AC power flow equations,which are then approximated by a polyhedron to improve tractability.Further,an efficient adaptive constraint generation algorithm is employed to construct the proposed dispatchable region.Case studies on distribution systems of various scales validate the computational efficiency and accuracy of the proposed method.展开更多
Line-commutated converter (LCC)-based high-voltage DC (HVDC) systems have been integrated with bulk AC power grids for interregional transmission of renewable power. The nonlinear LCC model brings additional nonconvex...Line-commutated converter (LCC)-based high-voltage DC (HVDC) systems have been integrated with bulk AC power grids for interregional transmission of renewable power. The nonlinear LCC model brings additional nonconvexity to optimal power flow (OPF) of hybrid AC-DC power grids. A convexification method for the LCC station model could address such nonconvexity but has rarely been discussed. We devise an equivalent reformulation for classical LCC station models that facilitates second-order cone convex relaxation for the OPF of LCC-based AC-DC power grids. We also propose sufficient conditions for exactness of convex relaxation with its proof. Equivalence of the proposed LCC station models and properties, exactness, and effectiveness of convex relaxation are verified using four numerical simulations. Simulation results demonstrate a globally optimal solution of the original OPF can be efficiently obtained from relaxed model.展开更多
The increasing number of gas-fired units has significantly intensified the coupling between electric and gas power networks.Traditionally,nonlinearity and nonconvexity in gas flow equations,together with renewable-ind...The increasing number of gas-fired units has significantly intensified the coupling between electric and gas power networks.Traditionally,nonlinearity and nonconvexity in gas flow equations,together with renewable-induced stochasticity,resulted in a computationally expensive model for unit commitment in electricity-gas coupled integrated energy systems(IES).To accelerate stochastic day-ahead scheduling,we applied and modified Progressive Hedging(PH),a heuristic approach that can be computed in parallel to yield scenario-independent unit commitment.Through early termination and enumeration techniques,the modified PH algorithm saves considerable com,putational time for certain generation cost settings or when the scale of the IES is large.Moreover,an adapted second-order cone relaxation(SOCR)is utilized to tackle the nonconvex gas flow equation.Case studies were performed on the IEEE 24.bus system/Belgium 20-node gas system and the IEEE 118-bus system/Belgium 20-node gas system.The computational efficiency when employing PH is 188 times that of commercial software,and the algorithm even outperforms Benders Decomposition.At the same time,the gap between the PH algorithm and the benchmark is less than 0.01% in both IES systems,which proves that the solutions produced by PH reach acceptable optimality in this stochastic UC problem.展开更多
基金the National Natural Science Foundation of China(Grant No.52177086)the Fundamental Research Funds for the Central Universities(Grant No.2023ZYGXZR063)。
文摘Uncertainty in distributed renewable generation threatens the security of power distribution systems.The concept of dispatchable region is developed to assess the ability of power systems to accommodate renewable generation at a given operating point.Although DC and linearized AC power flow equations are typically used to model dispatchable regions for transmission systems,these equations are rarely suitable for distribution networks.To achieve a suitable trade-off between accuracy and efficiency,this paper proposes a dispatchable region formulation for distribution networks using tight convex relaxation.Secondorder cone relaxation is adopted to reformulate AC power flow equations,which are then approximated by a polyhedron to improve tractability.Further,an efficient adaptive constraint generation algorithm is employed to construct the proposed dispatchable region.Case studies on distribution systems of various scales validate the computational efficiency and accuracy of the proposed method.
基金supported by the National Natural Science Foundation of China under Grant 52177086the Fundamental Research Funds for the Central Universities under Grant 2023ZYGXZR063the Science and Technology Program of Guizhou Power Grid Coorperation under Grant GZKJXM20222386.
文摘Line-commutated converter (LCC)-based high-voltage DC (HVDC) systems have been integrated with bulk AC power grids for interregional transmission of renewable power. The nonlinear LCC model brings additional nonconvexity to optimal power flow (OPF) of hybrid AC-DC power grids. A convexification method for the LCC station model could address such nonconvexity but has rarely been discussed. We devise an equivalent reformulation for classical LCC station models that facilitates second-order cone convex relaxation for the OPF of LCC-based AC-DC power grids. We also propose sufficient conditions for exactness of convex relaxation with its proof. Equivalence of the proposed LCC station models and properties, exactness, and effectiveness of convex relaxation are verified using four numerical simulations. Simulation results demonstrate a globally optimal solution of the original OPF can be efficiently obtained from relaxed model.
基金supported by the National Key Research and Development Program(SQ 2020YFE0200400)the National Natural Science Foundation of China(No.52007123)the Science,Technology and Innovation Commission of Shenzhen Municipality(No.JCYJ 20170411152331932).
文摘The increasing number of gas-fired units has significantly intensified the coupling between electric and gas power networks.Traditionally,nonlinearity and nonconvexity in gas flow equations,together with renewable-induced stochasticity,resulted in a computationally expensive model for unit commitment in electricity-gas coupled integrated energy systems(IES).To accelerate stochastic day-ahead scheduling,we applied and modified Progressive Hedging(PH),a heuristic approach that can be computed in parallel to yield scenario-independent unit commitment.Through early termination and enumeration techniques,the modified PH algorithm saves considerable com,putational time for certain generation cost settings or when the scale of the IES is large.Moreover,an adapted second-order cone relaxation(SOCR)is utilized to tackle the nonconvex gas flow equation.Case studies were performed on the IEEE 24.bus system/Belgium 20-node gas system and the IEEE 118-bus system/Belgium 20-node gas system.The computational efficiency when employing PH is 188 times that of commercial software,and the algorithm even outperforms Benders Decomposition.At the same time,the gap between the PH algorithm and the benchmark is less than 0.01% in both IES systems,which proves that the solutions produced by PH reach acceptable optimality in this stochastic UC problem.
