Reconfiguration of Shipboard Power System Using Improved Ant Colony Optimization

Article Preview

Abstract:

An improved ant colony optimization is presented for solving subset problem by using k-nearest neighbor, which is used to reconfigure shipboard 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 reconfigure shipboard power system efficiently.

You might also be interested in these eBooks

Info:

Periodical:

Key Engineering Materials (Volumes 480-481)

Pages:

1185-1190

Citation:

Online since:

June 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Yao Lixiao, Ren Yannan, Fei Jianan. Ant colony system algorithm for distribution network reconfiguration [J]. Power System and Automation Journal (Proceedings of the CSU-EPSA), 2007, 19 (6) : 35-39.

Google Scholar

[2] Huang Jian, Zhang Yao, Li Qiwen. Application of Ant Colony System in Distribution Reconfiguration [J]. Power System and Automation Journal (Proceedings of the CSU-EPSA), 2007, 19 (4) : 59-64.

Google Scholar

[3] Sanjeev K, Srivastava, Karen L Butler-Purry, NDR Sarma. Shipboard power restored for active duty [J]. IEEE Computer Applications in Power, 2002, 15 (3) : 16-23.

DOI: 10.1109/mcap.2002.1018818

Google Scholar

[4] Nagata T, Sasaki HA Multi-Agent Approach to Power System Restoration [J]. IEEE TRANSACTIONS ON POWER SYSTEMS, 2002, 17 (2) : 457-462.

DOI: 10.1109/tpwrs.2002.1007918

Google Scholar

[5] Li Hongjiang, Lu Zongxiang, Wang Miao, et al. Contrasting analysis of shipboard power system topological structures based on reliability model [J]. Electro technical Journal (Transactions of China Electro technical Society), 2006, 21 (11) : 47-52.

Google Scholar

[6] Dorigo M, Gambardella L M. Ant Colony System: A cooperative learning approach to the Traveling Salesman Problem [J]. IEEE Trans on Evolutionary Computation. 1997, 1 (1) : 53-66.

DOI: 10.1109/4235.585892

Google Scholar

[7] Dorigo M and Di Caro G. The Ant Colony Optimization Meta-heuristic [M]. London, UK, MeGraw-Hill , 1999. 11-32.

Google Scholar

[8] Xiao Yunshi, Li Bingyu. Small Window of Ant Colony Algorithm [J]. Computer Engineering, 2003, 29 (20) : 143-145.

Google Scholar