改进蚁群算法求解船舶电力系统故障重构问题  

Service Reconfiguration of Shipboard Power System Using Improved Ant Colony Algorithm

作　　者：李哲[1] 夏立[1] 

机构地区：[1]海军工程大学电气与信息工程学院,武汉430033

出　　处：《电力系统及其自动化学报》2009年第2期47-52,共6页Proceedings of the CSU-EPSA

基　　金：国防科技重点实验室基金项目(9140C8402040802)

摘　　要：船舶电力系统故障重构是一典型的非线性组合优化问题。文中给出一种改进的蚁群算法来实现故障下的网络重构,将重构问题看成子集类优化选择问题,修改并建立适合解决此类问题的蚁群算法模型。根据船舶电力系统重构特点,设计了一种可变邻域搜索算子以进一步探索优质解附近可能存在的更优解,针对算法易出现的劣质解元件,设计了两种优化操作以减少劣质解的产生,改善解集合的质量。算例分析表明,改进后的蚁群算法可以有效实现船舶电力系统的故障重构。The electrical network reconfiguration of shipboard power system （SPS） is a typical nonlinear combinatorial optimization problem. A new improved ant colony system algorithm（IACS） is presented in this paper which can work effectively. First ,the restoration problem is considered as a typical subset problem,then the mathematic model of improved ant colony system is formed for this problem. A new neighbor search operator is designed according to the characteristic of SPS. In order to improve the quality of the solution, two optimal operations is presented in this paper. Case study shows that the IACS can improve the speed of convergence and reconfigure electrical network problem efficiently.

关 键 词：船舶电力系统 故障重构 改进蚁群算法 可变邻域搜索算子 

分 类 号：TM72[电气工程—电力系统及自动化]