Haiyan Zheng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Haiyan Zheng has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Linfeng Yang
Guangxi Key Laboratory of Multimedia Communication and Network Technology, School of Computer Electronics and Information, Guangxi University, Nanning 530004, China
2 shared publications - Liying Huang
College of Mathematics and Information Science, Guangxi University, Nanning 530004, China
2 shared publications - Shifei Chen
School of Electrical Engineering, Guangxi University, Nanning 530004, China
2 shared publications - Chunming Tang
Guangxi University
1 shared publication - Jiayi Li
School of Mathematics, Jiangsu Center for Applied Mathematics (CUMT), China University of Mining and Technology, Xuzhou, People’s Republic of China
1 shared publication Jinjiao Yin
School of Computer Electronics and Information, Guangxi Key Laboratory of Multimedia Communication and Network Technology, Guangxi University, Nanning, China
1 shared publication
Latest Publications
- Open Access
- 21 January 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (2) , 1097
A Distributed Operational Method for Convex Hull Pricing Based on the Alternating Direction Method of Multipliers with Dantzig–Wolfe and Benders Decomposition
Due to the non-convex characteristic of the power system, it may be difficult for power generators to recover costs by following the system operators. Therefore, independent system operators have introduced discriminatory supplementary payments as incentive measures. In this context, convex hull pricing serves as an integrated solution, capable of markedly reducing such additional payouts. For the convex hull pricing problem, we propose a distributed solution method. This algorithm is based on Dantzig–Wolfe decomposition and Benders decomposition. According to the characteristics of different units, the model is decomposed into a master problem and a group of independent subproblems, and the consensus ADMM method is used to solve the master problem. The convex hull pricing problem can still be solved using this method when the data is stored separately or when the independent agents responsible for each unit wish to protect their information privacy. While ensuring the confidentiality of each unit’s information, high-quality solutions can still be obtained with high efficiency. By comparing the numerical results with those of the other three convex hull pricing algorithms, it is evident that our algorithm can obtain high-quality solutions.
- 21 January 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (2) , 1097
Open AccessA Distributed Operational Method for Convex Hull Pricing Based on the Alternating Direction Method of Multipliers with Dantzig–Wolfe and Benders Decomposition
Due to the non-convex characteristic of the power system, it may be difficult for power generators to recover costs by following the system operators. Therefore, independent system operators have introduced discriminatory supplementary payments as incentive measures. In this context, convex hull pricing serves as an integrated solution, capable of markedly reducing such additional payouts. For the convex hull pricing problem, we propose a distributed solution method. This algorithm is based on Dantzig–Wolfe decomposition and Benders decomposition. According to the characteristics of different units, the model is decomposed into a master problem and a group of independent subproblems, and the consensus ADMM method is used to solve the master problem. The convex hull pricing problem can still be solved using this method when the data is stored separately or when the independent agents responsible for each unit wish to protect their information privacy. While ensuring the confidentiality of each unit’s information, high-quality solutions can still be obtained with high efficiency. By comparing the numerical results with those of the other three convex hull pricing algorithms, it is evident that our algorithm can obtain high-quality solutions.
- Open Access
- 18 April 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (8) , 4498
Stable Variable Fixation for Accelerated Unit Commitment via Graph Neural Network and Linear Programming Hybrid Learning
The Unit Commitment Problem (UCP) is a critical component of power market decision-making and is typically formulated as Mixed Integer Programming (MIP). Given the complexity of solving MIPs, efficiently solving large-scale UCPs remains a significant challenge. This paper presents a hybrid Graph Neural Network (GNN)–Linear Programming (LP) framework to accelerate the solution of large-scale Unit Commitment Problems (UCPs) while maintaining the quality of solutions. By analyzing variable stability through historical branch-and-bound (B&B) trajectories, we classify MIP variables into dynamically adjustable stable and unstable groups. We adopt an MIP formulation that includes multiple types of binary variables—such as commitment, startup, and shutdown variables—and extract additional information from these auxiliary binary variables. This enriched representation provides more candidates for stable variable fixation, helping to improve variable refinement, mitigate suboptimality, and enhance computational efficiency. A bipartite GNN is trained offline to predict stable variables based on system topology and historical operational patterns. During online optimization, instance-specific root LP solutions refine these predictions, enabling adaptive variable fixation via a dual-threshold mechanism that integrates GNN confidence and LP relaxations. To mitigate suboptimality risks, we introduce temporally flexible fixation strategies—hard fixation for variables with persistent stability and soft fixation allowing limited temporal adjustments—alongside a GNN-guided branching rule to prioritize unstable variables. Numerical experiments demonstrate that jointly fixing commitment, startup, and shutdown variables yields better performance compared to fixing only commitment variables. Ablation studies further validate the importance of hard fixation and customized branching strategies, especially for large-scale systems.
- 18 April 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (8) , 4498
Open AccessStable Variable Fixation for Accelerated Unit Commitment via Graph Neural Network and Linear Programming Hybrid Learning
The Unit Commitment Problem (UCP) is a critical component of power market decision-making and is typically formulated as Mixed Integer Programming (MIP). Given the complexity of solving MIPs, efficiently solving large-scale UCPs remains a significant challenge. This paper presents a hybrid Graph Neural Network (GNN)–Linear Programming (LP) framework to accelerate the solution of large-scale Unit Commitment Problems (UCPs) while maintaining the quality of solutions. By analyzing variable stability through historical branch-and-bound (B&B) trajectories, we classify MIP variables into dynamically adjustable stable and unstable groups. We adopt an MIP formulation that includes multiple types of binary variables—such as commitment, startup, and shutdown variables—and extract additional information from these auxiliary binary variables. This enriched representation provides more candidates for stable variable fixation, helping to improve variable refinement, mitigate suboptimality, and enhance computational efficiency. A bipartite GNN is trained offline to predict stable variables based on system topology and historical operational patterns. During online optimization, instance-specific root LP solutions refine these predictions, enabling adaptive variable fixation via a dual-threshold mechanism that integrates GNN confidence and LP relaxations. To mitigate suboptimality risks, we introduce temporally flexible fixation strategies—hard fixation for variables with persistent stability and soft fixation allowing limited temporal adjustments—alongside a GNN-guided branching rule to prioritize unstable variables. Numerical experiments demonstrate that jointly fixing commitment, startup, and shutdown variables yields better performance compared to fixing only commitment variables. Ablation studies further validate the importance of hard fixation and customized branching strategies, especially for large-scale systems.
- 18 February 2025
- Published by Springer Nature in Electrical Engineering
- Vol. 107 (7) , 9335-9351
A CVaR-based distributionally robust approach for distribution networks reconfiguration with distributed generation
- 18 February 2025
- Published by Springer Nature in Electrical Engineering
- Vol. 107 (7) , 9335-9351
A CVaR-based distributionally robust approach for distribution networks reconfiguration with distributed generation
- 4 April 2024
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 70 (3) , 2427-2452
An inertial Fletcher–Reeves-type conjugate gradient projection-based method and its spectral extension for constrained nonlinear equations
- 4 April 2024
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 70 (3) , 2427-2452
An inertial Fletcher–Reeves-type conjugate gradient projection-based method and its spectral extension for constrained nonlinear equations
- 13 January 2023
- Published by Springer Nature in Numerical Algorithms
- Vol. 94 (1) , 131-147
A class of spectral conjugate gradient methods for Riemannian optimization
- 13 January 2023
- Published by Springer Nature in Numerical Algorithms
- Vol. 94 (1) , 131-147
A class of spectral conjugate gradient methods for Riemannian optimization
- Open Access
- 9 January 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (2) , 346
Mixed-Integer Conic Formulation of Unit Commitment with Stochastic Wind Power
Due to the high randomness and volatility of renewable energy sources such as wind energy, the traditional thermal unit commitment (UC) model is no longer applicable. In this paper, in order to reduce the possible negative effects of an inaccurate wind energy forecast, the chance-constrained programming (CCP) method is used to study the UC problem with uncertainty wind power generation, and chance constraints such as power balance and spinning reserve are satisfied with a predetermined probability. In order to effectively solve the CCP problem, first, we used the sample average approximation (SAA) method to transform the chance constraints into deterministic constraints and to obtain a mixed-integer quadratic programming (MIQP) model. Then, the quadratic terms were incorporated into the constraints by introducing some auxiliary variables, and some second-order cone constraints were formed by combining them with the output characteristics of thermal unit; therefore, a tighter mixed-integer second-order cone programming (MISOCP) formulation was obtained. Finally, we applied this method to some systems including 10 to 100 thermal units and 1 to 2 wind units, and we invoked MOSEK in MATLAB to solve the MISOCP formulation. The numerical results obtained within 24 h confirm that not only is the MISOCP formulation a successful reformulation that can achieve better suboptimal solutions, but it is also a suitable method for solving the large-scale uncertain UC problem. In addition, for systems of up to 40 units within 24 h that do not consider wind power and pollution emissions, the numerical results were compared with those of previously published methods, showing that the MISOCP formulation is very promising, given its excellent performance.
- 9 January 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (2) , 346
Open AccessMixed-Integer Conic Formulation of Unit Commitment with Stochastic Wind Power
Due to the high randomness and volatility of renewable energy sources such as wind energy, the traditional thermal unit commitment (UC) model is no longer applicable. In this paper, in order to reduce the possible negative effects of an inaccurate wind energy forecast, the chance-constrained programming (CCP) method is used to study the UC problem with uncertainty wind power generation, and chance constraints such as power balance and spinning reserve are satisfied with a predetermined probability. In order to effectively solve the CCP problem, first, we used the sample average approximation (SAA) method to transform the chance constraints into deterministic constraints and to obtain a mixed-integer quadratic programming (MIQP) model. Then, the quadratic terms were incorporated into the constraints by introducing some auxiliary variables, and some second-order cone constraints were formed by combining them with the output characteristics of thermal unit; therefore, a tighter mixed-integer second-order cone programming (MISOCP) formulation was obtained. Finally, we applied this method to some systems including 10 to 100 thermal units and 1 to 2 wind units, and we invoked MOSEK in MATLAB to solve the MISOCP formulation. The numerical results obtained within 24 h confirm that not only is the MISOCP formulation a successful reformulation that can achieve better suboptimal solutions, but it is also a suitable method for solving the large-scale uncertain UC problem. In addition, for systems of up to 40 units within 24 h that do not consider wind power and pollution emissions, the numerical results were compared with those of previously published methods, showing that the MISOCP formulation is very promising, given its excellent performance.
- Open Access
- 22 October 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (21) , 2686
Outer Approximation Method for the Unit Commitment Problem with Wind Curtailment and Pollutant Emission
This paper considers the fast and effective solving method for the unit commitment (UC) problem with wind curtailment and pollutant emission in power systems. Firstly, a suitable mixed-integer quadratic programming (MIQP) model of the corresponding UC problem is presented by some linearization techniques, which is difficult to solve directly. Then, the MIQP model is solved by the outer approximation method (OAM), which decomposes the MIQP into a mixed-integer linear programming (MILP) master problem and a nonlinear programming (NLP) subproblem for alternate iterative solving. Finally, simulation results for six systems with up to 100 thermal units and one wind unit in 24 periods are presented, which show the practicality of MIQP model and the effectiveness of OAM.
- 22 October 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (21) , 2686
Open AccessOuter Approximation Method for the Unit Commitment Problem with Wind Curtailment and Pollutant Emission
This paper considers the fast and effective solving method for the unit commitment (UC) problem with wind curtailment and pollutant emission in power systems. Firstly, a suitable mixed-integer quadratic programming (MIQP) model of the corresponding UC problem is presented by some linearization techniques, which is difficult to solve directly. Then, the MIQP model is solved by the outer approximation method (OAM), which decomposes the MIQP into a mixed-integer linear programming (MILP) master problem and a nonlinear programming (NLP) subproblem for alternate iterative solving. Finally, simulation results for six systems with up to 100 thermal units and one wind unit in 24 periods are presented, which show the practicality of MIQP model and the effectiveness of OAM.