基于自适应海鸥优化算法的电力系统优化调度问题
Optimization Scheduling of Power Systems Based on Adaptive Seagull Optimization Algorithm
DOI: 10.12677/sg.2026.163006, PDF,    科研立项经费支持
作者: 王春源:安徽电子信息职业技术学院机电工程学院,安徽 蚌埠
关键词: 电力系统海鸥优化算法自适应迁移算子Power System Seagull Optimization Algorithm Adaptive Migration Operator
摘要: 电力系统优化调度是保障电力系统安全、经济、稳定运行的核心环节,其本质是一类多约束、非线性、多极值的复杂组合优化问题。传统优化算法易出现收敛速度慢、早熟收敛、寻优精度不足等缺陷,难以满足调度需求。针对上述问题,文章提出了基于自适应海鸥优化算法(Adaptive Seagull Optimization Algorithm, ASOA),用于求解电力系统优化调度问题。首先,在原始海鸥优化算法(Seagull Optimization Algorithm, SOA)的基础上,引入自适应权重因子,通过非线性动态调节搜索步长,平衡算法的全局探索与局部开发能力;其次,构造融合种群平均位置与全局最优个体的迁移算子,替代原始单一最优引导机制,维持种群多样性,有效抑制早熟收敛。将改进算法应用于求解电力系统优化调度问题,验证了该算法的有效性。
Abstract: The optimization scheduling of power systems is a core aspect of ensuring the safe, economical, and stable operation of power systems. It essentially represents a complex combinatorial optimization problem characterized by multiple constraints, nonlinearity, and multiple extrema. Traditional optimization algorithms often suffer from drawbacks such as slow convergence speed, premature convergence, and insufficient optimization accuracy, making it challenging to meet scheduling requirements. To address these issues, this paper proposes an Adaptive Seagull Optimization Algorithm (ASOA) for solving the optimization scheduling problem in power systems. First, an adaptive weight factor is introduced based on the original Seagull Optimization Algorithm (SOA) to dynamically adjust the search step size nonlinearly, thereby balancing the global exploration and local exploitation capabilities of the algorithm. Second, a migration operator that integrates the average position of the population with the global optimal individual is constructed to replace the original single optimal guidance mechanism, maintaining population diversity and effectively suppressing premature convergence. The improved algorithm is applied to solve the optimization scheduling problem in power systems, demonstrating its effectiveness.
文章引用:王春源. 基于自适应海鸥优化算法的电力系统优化调度问题[J]. 智能电网, 2026, 16(3): 51-56. https://doi.org/10.12677/sg.2026.163006

参考文献

[1] 杨银国, 谢平平, 刘洋, 等. 基于深度优化算法的风光储多能互补电力系统优化调度策略[J]. 电网与清洁能源, 2025, 41(7): 122-131.
[2] 郭智薇, 陈胜. 基于企业发展粒子群算法的微电网优化调度[J]. 四川文理学院学报, 2025, 35(5): 127-136.
[3] 梁静, 葛士磊, 瞿博阳, 等. 求解电力系统经济调度问题的改进粒子群优化算法[J]. 控制与决策, 2020, 35(8): 1813-1822.
[4] 杨德友, 刘世宇. 求解电力系统多目标环境经济调度的帕累托最优MFO算法[J]. 电工电能新技术, 2018, 37(2): 30-37.
[5] Dhiman, G. and Kumar, V. (2019) Seagull Optimization Algorithm: Theory and Its Applications for Large-Scale Industrial Engineering Problems. Knowledge-Based Systems, 165, 169-196. [Google Scholar] [CrossRef
[6] Mohammadi-Ivatloo, B., Rabiee, A., Soroudi, A. and Ehsan, M. (2012) Iteration PSO with Time Varying Acceleration Coefficients for Solving Non-Convex Economic Dispatch Problems. International Journal of Electrical Power & Energy Systems, 42, 508-516. [Google Scholar] [CrossRef
[7] Saber, A.Y. (2012) Economic Dispatch Using Particle Swarm Optimization with Bacterial Foraging Effect. International Journal of Electrical Power & Energy Systems, 34, 38-46. [Google Scholar] [CrossRef
[8] Cai, J., Ma, X., Li, L., et al. (2007) Chaotic Particle Swarm Optimization for Economic Dispatch Considering the Generator Constraints. Energy Conversion and Management, 48, 645-653. [Google Scholar] [CrossRef
[9] Kennedy, J. and Eberhart, R. (1995) Particle Swarm Optimization. Proceedings of ICNN’95 International Conference on Neural Networks, Perth, 27 November-1 December 1995, 1942-1948. [Google Scholar] [CrossRef
[10] Chen, X., Tianfield, H., Mei, C., Du, W. and Liu, G. (2016) Biogeography-Based Learning Particle Swarm Optimization. Soft Computing, 21, 7519-7541. [Google Scholar] [CrossRef
[11] Mezura-Montes, E. and Cetina-Domínguez, O. (2012) Empirical Analysis of a Modified Artificial Bee Colony for Constrained Numerical Optimization. Applied Mathematics and Computation, 218, 10943-10973. [Google Scholar] [CrossRef
[12] Wang, Y., Cai, Z.X., Zhou, Y., et al. (2008) An Adaptive Tradeoff Model for Constrained Evolutionary Optimization. IEEE Transactions on Evolutionary Computation, 12, 80-92. [Google Scholar] [CrossRef