摘要
输电网络扩展规划是一个非常复杂的大规模组合优化问题。文章提出了一种基于蚁群最优的输电网络扩展规划法(ACO)。 ACO法来自对蚁群收集行为的研究 ,是一种求解组合最优问题的新型通用启发式方法。这种方法的主要特征是正反馈、分布式计算以及富于建设性的贪婪启发式搜索的运用。作者初步研究了 ACO法在单阶段输电网扩展规划中的应用 ,建立了相应的数学模型 ,设计了相应的算法 ,并在IEEE Garver- 6系统上进行了测算。结果表明所提方法是有效的。
Transmission network expansion planning is a very complicated, nonlinear, large scale combinatorial optimization problem. In this paper, a novel method called Ant Colony Optimization (ACO) is presented to solve the problem of transmission network expansion planning. ACO algorithm, derived from the study of the behavior of ant colonies, is a new general purpose heuristic algorithm for hard combinatorial optimization problems. The main characteristics of this method are positive feedback, distributed computation, and the use of a constructive greedy heuristic. In this paper, the application of ACO to transmission network expansion planning is investigated, the corresponding mathematical mode is established and solution algorithms are developed. The presented method has been tested on Garver 6 system, and the results show that this method is feasible and efficient.
出处
《电网技术》
EI
CSCD
北大核心
2001年第6期21-24,共4页
Power System Technology
关键词
输电网络
扩展规划
数学模型
蚁群最优算法
transmission network expansion planning
Ant Colony Optimization (ACO)
combinatorial optimization
multi agent