计及短路电流约束的机组组合与支路投切联合优化启发式分解算法
徐良德 , 吴楚钦 , 郭挺 , 刘明波 , 胡林麟 , 林舜江 , 陈中豪 , 李诗颖
南方电网技术 ›› 2025, Vol. 19 ›› Issue (3) : 153 -162.
计及短路电流约束的机组组合与支路投切联合优化启发式分解算法
Heuristic Decomposition Algorithm for Joint Optimization of Unit Commitment and Branch Switching Incorporating Short-Circuit Current Constraints
在机组组合优化问题中,考虑短路电流约束,并与支路投切问题联合优化,能够给出安全性和经济性更高的系统运行方案。但由于问题规模庞大,其求解面临挑战。为此提出一种基于目标级联分析和大规模邻域搜索的启发式分解算法。首先建立计及短路电流约束的机组组合与支路投切联合优化模型,然后将该模型转化为具有可分结构的混合整数线性规划模型,再采用目标级联分析法将转化后的模型分解为上层协调主问题、下层整数规划子问题和线性规划子问题,并在求解下层子问题时引入大规模邻域搜索。最后,在IEEE 54机118节点系统和某实际电力系统上的仿真计算表明,采用所提算法求解问题可以快速收敛得到可行解,同时不影响解的质量。
In the optimization of unit commitment, it can provide a safer and more economical system operation scheme considering short-circuit current constraints and branch switching. However, its solution faces challenges due to the large scale of the problems. A heuristic decomposition algorithm is proposed based on analytical target cascade and large neighborhood search. First of all, the joint optimization model of unit commitment and branch switching incorporating short-circuit current constraints is established and hence it is transformed into a mixed integer linear programming model with a separable structure. Then, the analytical target cascade method is used to decompose the converted model into upper level coordination master problem, lower level integer programming and linear programming subproblems. Moreover, the large neighborhood search is introduced in solving the lower level subproblems. Finally, the simulations on IEEE 118-bus and 54-unit systems and an actual power system show that the proposed algorithm can quickly converge to feasible solutions, whereas not affecting solution quality.
机组组合 / 目标级联分析 / 大规模邻域搜索 / 混合整数线性规划 / 短路电流约束 / 支路投切
unit commitment / analytical target cascade / large neighborhood search / mixed integer linear programming / short-circuit current constrains / branch switching
/
| 〈 |
|
〉 |