综合智慧能源 ›› 2026, Vol. 48 ›› Issue (7): 45-56.doi: 10.3969/j.issn.2097-0706.2026.07.005

• 电力系统智能化与控制 • 上一篇    下一篇

基于BFAN加速的分布式多目标海星算法在新型电力系统经济调度中的应用

杨涛(), 殷林飞*()   

  1. 广西大学 电气工程学院南宁 530004
  • 收稿日期:2026-03-23 修回日期:2026-04-24 出版日期:2026-07-25
  • 通讯作者: * 殷林飞(1990),男,副教授,博士生导师,博士,从事电力系统运行与分析、人工智能在电力系统的应用等方面的研究,yinlinfei@gxu.edu.cn
  • 作者简介:杨涛(2002),男,硕士生,从事电力系统优化调度、人工智能在电力系统的应用等方面的研究,yangtaolzx@163.com
  • 基金资助:
    国家自然科学基金项目(62463001)

Application of BFAN-accelerated distributed multi-objective starfish optimization algorithm in economic scheduling of new power systems

YANG Tao(), YIN Linfei*()   

  1. School of Electrical EngineeringGuangxi UniversityNanning 530004, China
  • Received:2026-03-23 Revised:2026-04-24 Published:2026-07-25
  • Supported by:
    National Natural Science Foundation of China(62463001)

摘要:

针对高比例可再生能源接入导致新型电力系统经济调度优化难度剧增,以及传统启发式算法普遍存在计算效率低、易陷入局部最优等瓶颈问题,提出了一种基于分叉融合注意力网络(BFAN)加速的分布式多目标海星优化算法(BFAN-DMOSFOA),旨在保障系统稳定运行的同时实现经济性与环保性的协同优化。首先,构建了包含发电成本、二氧化碳排放及二氧化硫排放最小化的多目标优化模型,并采用分布式框架将系统划分为多个自治区域,以解决集中式方法存在的单点故障与隐私泄露风险;其次,设计了BFAN,该网络融合了门控循环单元(GRU)的时序特征提取能力与自注意力机制的全局关联捕捉能力,用于精准预测种群演化趋势;最后,将BFAN嵌入分布式多目标海星优化算法(DMOSFOA)的迭代过程中,形成”运行决策-模拟评估”两阶段混合优化机制,利用训练好的BFAN在特定迭代区间内直接预测并生成高质量解,替代部分随机搜索过程,从而大幅加速算法收敛。在IEEE 118节点和1436节点两个电力系统上的仿真试验结果表明,所提BFAN-DMOSFOA算法在解集质量与计算效率上均显著优于离散多目标灰狼优化算法(DMOGWO)、离散多目标黏菌优化算法(DMOSMA)、离散多目标鲸鱼优化算法(DMOWOA)、基于深度神经网络加速的DMOSFOA(DNN-DMOSFOA)及未加速的DMOSFOA等对比算法。在解集质量方面,BFAN-DMOSFOA算法在两个试验中贡献的全局第一前沿非支配解占比分别高达52.58%和78.28%,占据绝对主导地位;其帕累托解集到理想点的平均欧氏距离在两个试验中分别为0.322 7和0.652 8,均为所有算法中最优,证明了其卓越的收敛精度。在计算效率方面,BFAN-DMOSFOA算法相较各对比算法均展现出显著的运行速度优势,在规模更大的1436节点系统中同样保持了强大的可扩展性。BFAN-DMOSFOA算法不仅通过分布式框架保障了数据隐私与系统鲁棒性,更通过BFAN网络实现了对优化过程的智能加速,在显著提升求解速度的同时,保证了帕累托最优解集的高质量与均匀分布。研究证实,该方法能够高效适配大规模、多约束的复杂调度场景,为新型电力系统的实时、经济、环保调度提供了强有力的技术支撑和可行的解决方案。

关键词: 新型电力系统, 经济调度, 多目标优化, 分布式框架, 分叉融合注意力网络, 分布式多目标海星优化算法, 深度学习

Abstract:

The integration of high proportions of renewable energy has significantly increased the difficulty of economic scheduling optimization in new power systems, while traditional heuristic algorithms generally suffer from low computational efficiency and a tendency to fall into local optima. To address these bottlenecks, a branched fusion attention network (BFAN)-accelerated distributed multi-objective starfish optimization algorithm (BFAN-DMOSFOA) was proposed to achieve coordinated optimization of economic and environmental performance while ensuring stable system operation. A multi-objective optimization model minimizing power generation cost, carbon dioxide emissions, and sulfur dioxide emissions was constructed, and a distributed framework was adopted to divide the system into multiple autonomous regions, thereby reducing the risks of single-point failure and privacy leakage in centralized methods. Subsequently, the BFAN was designed. This network integrated the temporal feature extraction capability of gated recurrent units and the global correlation capture capability of the self-attention mechanism to accurately predict population evolution trends. BFAN was embedded into the iterative process of DMOSFOA to form a two-stage hybrid optimization mechanism of operation decision and simulation evaluation. The trained BFAN directly predicted and generated high-quality solutions within specific iteration intervals, replacing part of the random search process and greatly accelerating algorithm convergence. Simulation results on IEEE 118-bus and 1436-bus power systems showed that the proposed BFAN-DMOSFOA significantly outperformed comparative algorithms, including discrete multi-objective grey wolf optimizer (DMOGWO), discrete multi-objective slime mould algorithm (DMOSMA), discrete multi-objective whale optimization algorithm (DMOWOA), a deep-neural-network-accelerated DMOSFOA (DNN-DMOSFOA), and the unaccelerated DMOSFOA, in both solution-set quality and computational efficiency. In terms of solution-set quality, the proportions of global first-front non-dominated solutions contributed by BFAN-DMOSFOA in the two experiments reached 52.58% and 78.28%, respectively, showing absolute dominance. The average Euclidean distances from Pareto solution sets to the ideal point were 0.322 7 and 0.652 8 in the two experiments, respectively, both of which were the best among all algorithms, demonstrating excellent convergence accuracy. In terms of computational efficiency, BFAN-DMOSFOA achieves markedly shorter running times than all comparison algorithms across both test systems, while exhibiting strong scalability on the larger-scale 1436-bus system. BFAN-DMOSFOA not only protected data privacy and system robustness through the distributed framework, but also realized intelligent acceleration of the optimization process through BFAN, substantially improving solution speed while ensuring high quality and uniform distribution of Pareto-optimal solution sets. The findings confirm that this method can efficiently adapt to large-scale, multi-constraint complex scheduling scenarios, providing strong technical support and a feasible solution for real-time, economic, and environmentally friendly scheduling of new power systems.

Key words: new power systems, economic scheduling, multi-objective optimization, distributed framework, branched fusion attention network, distributed multi-objective starfish optimization algorithm, deep learning

中图分类号: