Building on the previous chapter, this chapter proposes an improved spatial branch-and-cut (B&C) method for the rapid resilience assessment of integrated energy systems (IES). To accelerate fault recovery solutions, the proposed method introduces two key improvements to the traditional B&C algorithm. First, to address the non-convex characteristics of the integrated electricity-gas flow (OEGF), a novel cone-specific spatial branching strategy is proposed. Compared to existing strategies that can only handle bilinear equality constraints, the proposed method reduces the scale of branching variables by two-thirds without compromising solution accuracy. Second, a combined cut generation strategy is introduced, transforming fault scenario enumeration into a guided generation process within a single search tree. The core idea is to formulate the solution process for each fault scenario as a subset of the search tree, thereby reducing the load restoration problem to a single optimization process. The proposed algorithm is tested on systems of three different scales. Comparative analysis with seven existing algorithms further validates its superiority in both solution accuracy and computational efficiency.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Accelerated Resilience Assessment for IES Considering Non-convex Gas Flow Dynamics (Part II): Accelerated Evaluation Algorithm

  • Zhi Wu,
  • Qirun Sun,
  • Wei Gu,
  • Suyang Zhou,
  • Pengxiang Liu,
  • Yue Qiu

摘要

Building on the previous chapter, this chapter proposes an improved spatial branch-and-cut (B&C) method for the rapid resilience assessment of integrated energy systems (IES). To accelerate fault recovery solutions, the proposed method introduces two key improvements to the traditional B&C algorithm. First, to address the non-convex characteristics of the integrated electricity-gas flow (OEGF), a novel cone-specific spatial branching strategy is proposed. Compared to existing strategies that can only handle bilinear equality constraints, the proposed method reduces the scale of branching variables by two-thirds without compromising solution accuracy. Second, a combined cut generation strategy is introduced, transforming fault scenario enumeration into a guided generation process within a single search tree. The core idea is to formulate the solution process for each fault scenario as a subset of the search tree, thereby reducing the load restoration problem to a single optimization process. The proposed algorithm is tested on systems of three different scales. Comparative analysis with seven existing algorithms further validates its superiority in both solution accuracy and computational efficiency.