SCShifei Chen

Shifei Chen

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Shifei Chen has a total of 6 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A Distributed Operational Method for Convex Hull Pricing Based on the Alternating Direction Method of Multipliers with Dantzig–Wolfe and Benders Decomposition

    by Linfeng Yang, Xinhan Lin, Shifei Chen, Zhiding Wu, Haiyan Zheng

    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

    Stable Variable Fixation for Accelerated Unit Commitment via Graph Neural Network and Linear Programming Hybrid Learning

    by Linfeng Yang, Peilun Li, Shifei Chen, Haiyan Zheng

    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.


  • Open Access

    Multiple-Periods Locally-Facet-Based MIP Formulations for the Unit Commitment Problem

    by Linfeng Yang, Shifei Chen, Zhaoyang Dong

    The thermal unit commitment (UC) problem has historically been formulated as a mixed integer quadratic programming (MIQP), which is difficult to solve efficiently, especially for large-scale systems. The tighter characteristic reduces the search space, therefore, as a natural consequence, significantly reduces the computational burden. In literatures, many tightened formulations for a single unit with parts of constraints were reported without presenting explicitly how they were derived. In this paper, a systematic approach is developed to formulate tight formulations. The idea is to use more binary variables to represent the state of the unit so as to obtain the tightest upper bound of power generation limits and ramping constraints for a single unit. In this way, we propose a multi-period formulation based on sliding windows which may have different sizes for each unit in the system. Furthermore, a multi-period model taking historical status into consideration is obtained. Besides, sufficient and necessary conditions for the facets of single-unit constraints polytope are provided and redundant inequalities are eliminated. The proposed models and three other state-of-the-art models are tested on 73 instances with a scheduling time of 24 hours. The number of generators in the test systems ranges from 10 to 1080. The simulation results show that our proposed multi-period formulations are tighter than the other three state-of-the-art models when the window size of the multi-period formulation is greater than 2.