CORC  > 清华大学
Sparsity node ordering technology based on genetic algorithms
Luo Jun ; Yu Xin-jie
2010-05-06 ; 2010-05-06
关键词Practical Theoretical or Mathematical/ genetic algorithms matrix algebra power systems/ sparsity node ordering technology genetic algorithms power system calculation global optimal solution fitness function IEEE bus systems Tinney-2 algorithm optimal node ordering mode matrix calculation/ B8110 Power systems B0260 Optimisation techniques B0210 Algebra
中文摘要The application of sparsity technology evidently makes the matrix calculation of power system more efficient. The node ordering optimization is one of the key problems in sparsity technology and it is difficult to get its optimal solution. Genetic algorithms possess the features such as wide search space and easy to achieve or to be close to global optimal solution. To apply genetic algorithms to node ordering, a novel genetic coding and fitness function suitable to node ordering are proposed. Calculation results of IEEE 14-bus and 30-bus systems by the proposed method and the comparison of these results with that from famous Tinney-2 algorithm show that optimal node ordering mode can be obtained by use of the proposed node ordering method based on genetic algorithms.
语种中文 ; 中文
出版者Electr. Power Res. Inst ; China
内容类型期刊论文
源URL[http://hdl.handle.net/123456789/10946]  
专题清华大学
推荐引用方式
GB/T 7714
Luo Jun,Yu Xin-jie. Sparsity node ordering technology based on genetic algorithms[J],2010, 2010.
APA Luo Jun,&Yu Xin-jie.(2010).Sparsity node ordering technology based on genetic algorithms..
MLA Luo Jun,et al."Sparsity node ordering technology based on genetic algorithms".(2010).
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace