机构地区: 华南理工大学
出 处: 《电力系统自动化》 2001年第8期34-37,共4页
摘 要: 首先给出了一个综合考虑开关操作次数最少和网损最小的故障恢复重构的混合整数规划模型。 Tabu搜索技术是一种高效的启发式搜索技术 ,适合于解决整数规划和混合整数规划问题。文中将 Tabu搜索技术应用于所建立的故障恢复模型 ,并较详细地介绍了其求解过程。最后运用算例验证了 Tabu搜索法能有效地求解所给出的故障恢复问题。 A service restoration model for reconfiguration in which the possible number of switching operations minimization and the losses minimization are taken into account simultaneously is proposed in this paper. This belongs to a combinatorial integer-programming problem. Tabu search as a heuristic technique with high efficiency is of advantages for solving this kind of problems. Therefore, a new approach based on Tabu search is applied to solve this optimization problem and the implementation process is described in detail. Sample test shows that the Tabu search based method can solve the proposed model effectively.
关 键 词: 搜索 故障恢复 配电网 人工智能 整数规划 重构算法
领 域: [电气工程]