Xiaosheng Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xiaosheng Zhang has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Tao Ding
School of Electrical Engineering, Xi’an Jiaotong University, Xi’an 710049, China
7 shared publications - Chenggang Mu
Department of Electrical Engineering, Xian Jiaotong University, Xian, China
4 shared publications - Mohammad Shahidehpour
Illinois Institute of Technology
4 shared publications - Hongji Zhang
School of Electrical Engineering, Xian Jiaotong University, Xian, China
2 shared publications - Ming Qu
School of Electrical Engineering, Xian Jiaotong University, Xian, China
2 shared publications - Ouzhu Han
School of Electrical Engineering, Xian Jiaotong University, Xian, China
2 shared publications
Latest Publications
- 18 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Sustainable Energy
- Vol. 15 (4) , 2322-2335
Data-Driven Multistage Distribuionally Robust Programming to Hydrothermal Economic Dispatch With Renewable Energy Sources
The multistage solution is very important to achieve optimal hydrothermal economic dispatch considering the uncertainty of renewable energy sources. In data-driven settings, only some historical trajectories are available and the probability distribution is unknown. A data-driven scheme for multistage stochastic hydrothermal economic dispatch with Markovian uncertainties is proposed in this paper. Then a data-driven distributionally robust stochastic dual dynamic programming (DDR-SDDP) is proposed to tackle the corresponding computational intractability, where the conditional probability distributions are estimated by using kernel regression. The out-of-sample performances are improved by distributionally robust optimization on a Wasserstein distance-based ambiguity set. Furthermore, a scenario aggregation method is designed to reduce the computational burden. Numerical results for a practical regional power system in China are presented and analyzed to verify the effectiveness of the proposed method.
- 18 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Sustainable Energy
- Vol. 15 (4) , 2322-2335
Data-Driven Multistage Distribuionally Robust Programming to Hydrothermal Economic Dispatch With Renewable Energy Sources
The multistage solution is very important to achieve optimal hydrothermal economic dispatch considering the uncertainty of renewable energy sources. In data-driven settings, only some historical trajectories are available and the probability distribution is unknown. A data-driven scheme for multistage stochastic hydrothermal economic dispatch with Markovian uncertainties is proposed in this paper. Then a data-driven distributionally robust stochastic dual dynamic programming (DDR-SDDP) is proposed to tackle the corresponding computational intractability, where the conditional probability distributions are estimated by using kernel regression. The out-of-sample performances are improved by distributionally robust optimization on a Wasserstein distance-based ambiguity set. Furthermore, a scenario aggregation method is designed to reduce the computational burden. Numerical results for a practical regional power system in China are presented and analyzed to verify the effectiveness of the proposed method.
- 7 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Sustainable Energy
- Vol. 15 (2) , 859-870
A Two-Stage Stochastic Unit Commitment With Mixed-Integer Recourses for Nuclear Power Plants to Accommodate Renewable Energy
To provide flexibilities for peak regulations in power systems while addressing renewable energy uncertainties, this paper proposes a two-stage stochastic unit commitment model with peak regulation constraints of nuclear power plants (NPPs) under the “12-3-6-3” mode. The first stage aims to determine the optimal thermal unit commitment, and the second stage tries to adjust the operation modes of an NPP and thermal unit generation output to cope with different renewable energy scenarios. Due to the discrete adjustments of NPPs, the proposed model is mathematically a two-stage stochastic optimization with mixed-integer recourses. Furthermore, a Fenchel cut based bilevel decomposition is proposed to solve this model, where the inner second-stage subproblem is first relaxed into a linear program and a Fenchel cut is then generated to recover the facet of the convex hull solution. The technique can significantly accelerate the computational speed of the proposed model with a special mathematical structure. Numerical results on a provincial power system verify the effectiveness of the proposed model and method.
- 7 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Sustainable Energy
- Vol. 15 (2) , 859-870
A Two-Stage Stochastic Unit Commitment With Mixed-Integer Recourses for Nuclear Power Plants to Accommodate Renewable Energy
To provide flexibilities for peak regulations in power systems while addressing renewable energy uncertainties, this paper proposes a two-stage stochastic unit commitment model with peak regulation constraints of nuclear power plants (NPPs) under the “12-3-6-3” mode. The first stage aims to determine the optimal thermal unit commitment, and the second stage tries to adjust the operation modes of an NPP and thermal unit generation output to cope with different renewable energy scenarios. Due to the discrete adjustments of NPPs, the proposed model is mathematically a two-stage stochastic optimization with mixed-integer recourses. Furthermore, a Fenchel cut based bilevel decomposition is proposed to solve this model, where the inner second-stage subproblem is first relaxed into a linear program and a Fenchel cut is then generated to recover the facet of the convex hull solution. The technique can significantly accelerate the computational speed of the proposed model with a special mathematical structure. Numerical results on a provincial power system verify the effectiveness of the proposed model and method.
- 17 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 21 (3) , 3873-3885
Distributed Slack-Bus Based DC Optimal Power Flow With Transmission Loss: A Second-Order Cone Programming Approach and Sufficient Conditions
This paper proposed sufficient conditions of the zero duality gap for the second-order conic programming approach of the DC optimal power flow that quadratically embeds the transmission loss. The mechanism of the changes for locational marginal price with differently selecting the slack bus is revisited, based on which a load-weighted distributed slack bus method is introduced. Furthermore, a second-order conic programming-based convexification method is proposed by employing the duality analysis. A favorable property of the proposed method is that mild sufficient conditions of the zero duality gap can be derived by the analysis of Karush-Kuhn-Tucker conditions. Numerical results illustrate the effectiveness of the proposed method and physically prove the proposed sufficient conditions. Compared with traditional and similar market-clearing methods, the proposed method has better performance on convergence, robustness, and accuracy. Note to Practitioners —This paper was motivated by the problem of the pricing mechanism in the deregulated electricity market but it is also applicable to rapidly solving the power flow of power systems with sufficient reactive power. Existing approaches use the B-coefficient to estimate the transmission loss in the model non-linearly. In this paper, an improved approach considering transmission loss is proposed, which further introduces the distributed slack bus method and subsequently employs the second-order cone programming algorithm. The proposed method hedges the risk of appearing multiple solutions or lack of accuracy. Rigorous mathematical proofs are derived to support the method. For industrial practice, three sufficient conditions suitable for different kinds of power systems are given, indicating when the proposed approach can be efficiently applied The proposed method can be integrated into the existing electricity market trading platform for independent system operators and facilitates real-time market clearing and electricity price calculation. Future research is expected to improve the accuracy of the model based on nodal power balance equations.
- 17 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 21 (3) , 3873-3885
Distributed Slack-Bus Based DC Optimal Power Flow With Transmission Loss: A Second-Order Cone Programming Approach and Sufficient Conditions
This paper proposed sufficient conditions of the zero duality gap for the second-order conic programming approach of the DC optimal power flow that quadratically embeds the transmission loss. The mechanism of the changes for locational marginal price with differently selecting the slack bus is revisited, based on which a load-weighted distributed slack bus method is introduced. Furthermore, a second-order conic programming-based convexification method is proposed by employing the duality analysis. A favorable property of the proposed method is that mild sufficient conditions of the zero duality gap can be derived by the analysis of Karush-Kuhn-Tucker conditions. Numerical results illustrate the effectiveness of the proposed method and physically prove the proposed sufficient conditions. Compared with traditional and similar market-clearing methods, the proposed method has better performance on convergence, robustness, and accuracy. Note to Practitioners —This paper was motivated by the problem of the pricing mechanism in the deregulated electricity market but it is also applicable to rapidly solving the power flow of power systems with sufficient reactive power. Existing approaches use the B-coefficient to estimate the transmission loss in the model non-linearly. In this paper, an improved approach considering transmission loss is proposed, which further introduces the distributed slack bus method and subsequently employs the second-order cone programming algorithm. The proposed method hedges the risk of appearing multiple solutions or lack of accuracy. Rigorous mathematical proofs are derived to support the method. For industrial practice, three sufficient conditions suitable for different kinds of power systems are given, indicating when the proposed approach can be efficiently applied The proposed method can be integrated into the existing electricity market trading platform for independent system operators and facilitates real-time market clearing and electricity price calculation. Future research is expected to improve the accuracy of the model based on nodal power balance equations.
- 17 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industry Applications
- Vol. 59 (6) , 7238-7249
Multi-Time Scale Optimal Dispatch for the Wind Power Integrated System With Demand Response of Data Centers Based on Neural Network-Based Model Predictive Control
Data centers (DCs) are energy consumers with high electricity demand. Due to their Spatio-temporal demand response (DR) capabilities, DCs are crucial DR participants. In view of the difference in real-time requirements and continuity requirements of computing jobs, this work builds a detailed DR model of DCs. To make full use of the latest wind power predictive information, a multi-time scale optimal dispatch based on model predictive control (MPC) is proposed for wind power accommodation improvement and system operating security enhancement. As the real-time optimal dispatch is a quadratic programming problem and the total number of dispatching periods is large, the BP neural network is applied in this work to improve the computation speed. Finally, the proposed model is tested on an IEEE 30-bus power system with wind farms and DCs. Simulation results verify that DCs' DR participation plays an important role in promoting wind power accommodation and system load adjustment. Besides, it is proven that our proposed BP neural network-based MPC method can obtain optimal dispatching results with low computation costs.
- 17 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industry Applications
- Vol. 59 (6) , 7238-7249
Multi-Time Scale Optimal Dispatch for the Wind Power Integrated System With Demand Response of Data Centers Based on Neural Network-Based Model Predictive Control
Data centers (DCs) are energy consumers with high electricity demand. Due to their Spatio-temporal demand response (DR) capabilities, DCs are crucial DR participants. In view of the difference in real-time requirements and continuity requirements of computing jobs, this work builds a detailed DR model of DCs. To make full use of the latest wind power predictive information, a multi-time scale optimal dispatch based on model predictive control (MPC) is proposed for wind power accommodation improvement and system operating security enhancement. As the real-time optimal dispatch is a quadratic programming problem and the total number of dispatching periods is large, the BP neural network is applied in this work to improve the computation speed. Finally, the proposed model is tested on an IEEE 30-bus power system with wind farms and DCs. Simulation results verify that DCs' DR participation plays an important role in promoting wind power accommodation and system load adjustment. Besides, it is proven that our proposed BP neural network-based MPC method can obtain optimal dispatching results with low computation costs.
- 27 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 39 (2) , 3725-3737
Dual Stochastic Dual Dynamic Programming for Multi-Stage Economic Dispatch With Renewable Energy and Thermal Energy Storage
The rapid growth of renewable energy sources brings great challenges to the economic dispatch of the modern power system. Retrofitting thermal power plants with thermal energy storage (TES) can improve the operational flexibility of the plants to handle the uncertainty of renewable energy sources. An economic dispatch model which considers retrofitted coal-fired power plants with thermal energy storage is proposed to promote the proliferation of uncertain renewable energy resources. A multi-stage stochastic programming (MSSP) model is constructed to accommodate the uncertainties of renewable energy resources, which provides a higher level of flexibility as compared with the traditional two-stage stochastic programming solutions. In addition, dual stochastic dual dynamic programming is employed, and a new policy is proposed to enhance the computational efficiency of the proposed MSSP model. Numerical results for a practical regional power system in China are presented and analyzed to verify the effectiveness of the proposed solution method for the economic dispatch model.
- 27 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 39 (2) , 3725-3737
Dual Stochastic Dual Dynamic Programming for Multi-Stage Economic Dispatch With Renewable Energy and Thermal Energy Storage
The rapid growth of renewable energy sources brings great challenges to the economic dispatch of the modern power system. Retrofitting thermal power plants with thermal energy storage (TES) can improve the operational flexibility of the plants to handle the uncertainty of renewable energy sources. An economic dispatch model which considers retrofitted coal-fired power plants with thermal energy storage is proposed to promote the proliferation of uncertain renewable energy resources. A multi-stage stochastic programming (MSSP) model is constructed to accommodate the uncertainties of renewable energy resources, which provides a higher level of flexibility as compared with the traditional two-stage stochastic programming solutions. In addition, dual stochastic dual dynamic programming is employed, and a new policy is proposed to enhance the computational efficiency of the proposed MSSP model. Numerical results for a practical regional power system in China are presented and analyzed to verify the effectiveness of the proposed solution method for the economic dispatch model.
- 6 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 21 (2) , 1754-1766
Linearization Method for Large-Scale Hydro-Thermal Security-Constrained Unit Commitment
Security-constrained unit commitment (SCUC) is one of the most fundamental optimization problems in power systems. The objective of SCUC is to minimize the operating cost while respecting both system-wide and generator-specific constraints. It leads to a large-scale and mixed-integer programming (MIP) model with a large number of binary decision variables which is difficult to solve. This paper, based on the convex hull theory of single-unit, proposes a linearization method for the hydro-thermal SCUC problem with decoupled thermal units and variable-head hydro units. Then, the strategy of embedding two types of convex hulls in a multi-unit commitment and the heuristic method of constructing a feasible solution are designed, by which the multi-UC is approximated from large-scale mixed-integer programming to linear programming that can be solved in polynomial time. Finally, we theoretically prove that the optimal solution of the proposed LP model is always better than that of the Lagrangian Relaxation model. Numerical experiments on several large-scale test systems demonstrate the effectiveness and efficiency of the proposed method. Note to Practitioners —This paper proposes a linear programming model for the SCUC problem by lifting up to a higher-dimensional space. It realizes an important innovation in reducing the computational complexity of SCUC from the perspective of linearization. The proposed method can be well applied to large-scale long-term unit commitment problems. To better use this method, the following two properties should be highlighted: 1) the error of the proposed method is less than the Lagrangian relaxation method and decreases with the increasing system scales and 2) the computational efficiency of the proposed method is 10-100 times faster than that of the MIP model. We have tested many practical power systems and find that the error of the proposed LP model is usually very small compared with the precise MIP while the computational performance is significantly improved. In some practical cases, the decision makers usually do not want to find the precise optimal solution while only an approximation under a fast speed, because the boundary condition is imprecise. The proposed method is useful. Besides, for the cases that need the precise optimal solution, the proposed method can provide a high-quality initial solution for the MIP model to accelerate the convergence.
- 6 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 21 (2) , 1754-1766
Linearization Method for Large-Scale Hydro-Thermal Security-Constrained Unit Commitment
Security-constrained unit commitment (SCUC) is one of the most fundamental optimization problems in power systems. The objective of SCUC is to minimize the operating cost while respecting both system-wide and generator-specific constraints. It leads to a large-scale and mixed-integer programming (MIP) model with a large number of binary decision variables which is difficult to solve. This paper, based on the convex hull theory of single-unit, proposes a linearization method for the hydro-thermal SCUC problem with decoupled thermal units and variable-head hydro units. Then, the strategy of embedding two types of convex hulls in a multi-unit commitment and the heuristic method of constructing a feasible solution are designed, by which the multi-UC is approximated from large-scale mixed-integer programming to linear programming that can be solved in polynomial time. Finally, we theoretically prove that the optimal solution of the proposed LP model is always better than that of the Lagrangian Relaxation model. Numerical experiments on several large-scale test systems demonstrate the effectiveness and efficiency of the proposed method. Note to Practitioners —This paper proposes a linear programming model for the SCUC problem by lifting up to a higher-dimensional space. It realizes an important innovation in reducing the computational complexity of SCUC from the perspective of linearization. The proposed method can be well applied to large-scale long-term unit commitment problems. To better use this method, the following two properties should be highlighted: 1) the error of the proposed method is less than the Lagrangian relaxation method and decreases with the increasing system scales and 2) the computational efficiency of the proposed method is 10-100 times faster than that of the MIP model. We have tested many practical power systems and find that the error of the proposed LP model is usually very small compared with the precise MIP while the computational performance is significantly improved. In some practical cases, the decision makers usually do not want to find the precise optimal solution while only an approximation under a fast speed, because the boundary condition is imprecise. The proposed method is useful. Besides, for the cases that need the precise optimal solution, the proposed method can provide a high-quality initial solution for the MIP model to accelerate the convergence.
- 20 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 38 (2) , 1755-1758
An Algorithmic Approach for Inner Max-Min Model Under Norm-2 Type Uncertainty Set in Data-Driven Distributionally Robust Optimization
To accelerate the computational speed of data-driven distributionally robust optimization (DDRO), this letter presents a novel algorithmic approach to solve the inner max-min model under norm-2 type uncertainty set in DDRO. The proposed method can solve the problem in an easily implemented way instead of a time-consuming optimization process using commercial solvers. Comparisons of computational time between the algorithmic approach and optimization solvers verify the effectiveness of the proposed method.
- 20 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 38 (2) , 1755-1758
An Algorithmic Approach for Inner Max-Min Model Under Norm-2 Type Uncertainty Set in Data-Driven Distributionally Robust Optimization
To accelerate the computational speed of data-driven distributionally robust optimization (DDRO), this letter presents a novel algorithmic approach to solve the inner max-min model under norm-2 type uncertainty set in DDRO. The proposed method can solve the problem in an easily implemented way instead of a time-consuming optimization process using commercial solvers. Comparisons of computational time between the algorithmic approach and optimization solvers verify the effectiveness of the proposed method.