Peilun Li

Mr. Peilun Li


Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 April 2025 in Applied Sciences
Verified
Journal Article
Open access
PDF file
LYLinfeng Yang
Linfeng Yang
PLPeilun Li
Peilun Li
SCShifei Chen
Shifei Chen
ZHZheng Haiyan
Zheng Haiyan
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.

20 May 2025 in arXiv
Verified
Preprint
Open access
PDF file
LYLinfeng Yang
Linfeng Yang
PLPeilun Li
Peilun Li
JJJinbao Jian
Jinbao Jian
Unit commitment problem (UCP) is a critical component of power market decision-making. However, its computational complexity necessitates effi-cient solution methods. In this work we propose a framework to accelerate the solving process of the UCP, and the data collecting process for two dis-tinct graph neural network (GNN) policy. We at first train a Neural Initial Commitment Prediction policy to obtain an initial commitment for UCP. Sec-ond, a heuristic process is introduced to restore the feasibility of the initial commitment. Third, get the neighborhood based on the initial prediction then neighborhood search to improve the commitment. At last, we train a Neural neighborhood Prediction policy to predict the neighborhood of the incum-bent commitment at each iteration, continuously optimizing the commitment until the stopping condition is met. This approach produces high-quality ini-tial commitments that can be iteratively refined to meet higher accuracy re-quirements. The experimental results show that the GNN policies trained on the 80-unit system outperform commercial solvers on a 1080-unit system, and LNS performs better than commercial solver on more complex instanc-es.