摘要
蚁群算法是一种求解组合优化问题的新型通用启发式方法,具有正反馈、并行计算和鲁棒性强等优点。将蚁群算法应用于配电网故障后恢复重构,提出了综合考虑切负荷最小和开关操作次数最少的恢复重构模型,并详细介绍了其求解过程。算例证明该算法在配电网故障后恢复重构中应用的可行性和有效性。
Ant colony algorithm is a new general-purpose heuristic algorithm for combinatorial optimization problems. The main characteristics of this method are positive feedback, distributed computation and the use of constructive greedy heuristic. Therefore, this method is applied to service restoration reconfiguration in distribution networks. A service restoration model for reconfiguration in which the unrestored load minimization and the number of switching operations minimization are taken into account simultaneously is proposed, and the implementation process is described in detail. Sample test shows that the ant colony algorithm can solve the proposed model feasibly and effectively.
出处
《电气应用》
北大核心
2007年第9期41-44,共4页
Electrotechnical Application
基金
河南省教育厅自然科学基金
河南省科技攻关项目(0324250075)。
关键词
配电网
恢复重构
蚁群算法
distribution networks service restoration reconfiguration ant colony algorithm
