ZGZishan Guo

Zishan Guo

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Zishan Guo has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Interdependent Expansion Planning for Resilient Electricity and Natural Gas Networks

    by Weiqi Pan, Yang Li, Zishan Guo, Yuanshi Zhang

    This study explores enhancing the resilience of electric and natural gas networks against extreme events like windstorms and wildfires by integrating parts of the electric power transmissions into the natural gas pipeline network, which is less vulnerable. We propose a novel integrated energy system planning strategy that can enhance the systems’ ability to respond to such events. Our strategy unfolds in two stages. Initially, we devise expansion strategies for the interdependent networks through a detailed tri-level planning model, including transmission, generation, and market dynamics within a deregulated electricity market setting, formulated as a mixed-integer linear programming (MILP) problem. Subsequently, we assess the impact of extreme events through worst-case scenarios, applying previously determined network configurations. Finally, the integrated expansion planning strategies are evaluated using real-world test systems.


  • Open Access

    Stable Relay Learning Optimization Approach for Fast Power System Production Cost Minimization Simulation

    by Zishan Guo, Qinran Hu, Tao Qian, Xin Fang, Renjie Hu, Zaijun Wu

    Production cost minimization (PCM) simulation is commonly employed for assessing the operational efficiency, economic viability, and reliability, providing valuable insights for power system planning and operations. However, solving a PCM problem is time-consuming, consisting of numerous binary variables for simulation horizon extending over months and years. This hinders rapid assessment of modern energy systems with diverse planning requirements. Existing methods for accelerating PCM tend to sacrifice accuracy for speed. In this paper, we propose a stable relay learning optimization (s-RLO) approach within the Branch and Bound (B&B) algorithm. The proposed approach offers rapid and stable performance, and ensures optimal solutions. The two-stage s-RLO involves an imitation learning (IL) phase for accurate policy initialization and a reinforcement learning (RL) phase for time-efficient fine-tuning. When implemented on the popular SCIP solver, s-RLO returns the optimal solution up to 2 times faster than the default relpscost rule and 1.4 times faster than IL, or exhibits a smaller gap at the predefined time limit. The proposed approach shows stable performance, reducing fluctuations by approximately 50% compared with IL. The efficacy of the proposed s-RLO approach is supported by numerical results.