摘要
提出一种采用K阶近邻策略求解子集类问题的改进蚁群算法,应用到船舶电力系统故障重构问题中。将重构问题抽象为子集类优化选择问题,建立适合解决此类问题的蚁群算法模型。根据船舶电力系统故障重构特点,采用K阶近邻策略缩小算法的求解空间以提高寻优求解效率。算例分析及仿真实例表明,改进后的蚁群算法可以有效解决船舶电力系统故障重构问题。
An improved ant colony optimization is presented for solving subset problem by using k--nearest neighbor, which is used to reconfigurate ship power system. Reconfiguration is considered as a typical subset problem, a mathematic model is built to solve it. K--nearest neighbor method is used to decrease the space of solutions and improve efficiency. The result of simulation shows that the improved algorithm can reconfigurate ship power system efficiently.
出处
《计算技术与自动化》
2010年第1期1-4,共4页
Computing Technology and Automation
基金
国家科技重点实验室基金项目(9140C8402040802)
关键词
船舶电力系统
故障重构
改进蚁群算法
子集类问题
K阶近邻策略
ship power system
reeonfiguration
improved ant colony optimization
subset problem
k--nearest neighbor
