全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
电网技术  2006 

基于遗传算法的稀疏节点优化编号方法

, PP. 54-58

Keywords: 遗传算法,节点编号,稀疏技术,电力系统计算

Full-Text   Cite this paper   Add to My Lib

Abstract:

稀疏技术在电力系统中的应用显著提高了电力系统矩阵运算的效率。节点优化编号问题是稀疏技术的关键内容之一,求其最优解比较困难。遗传算法具有寻优空间广,易达到或者接近全局最优解的特点。采用遗传算法进行节点优化编号,提出了适合节点优化编号的遗传编码和适应值函数。通过对IEEE4节点和IEEE30节点系统的计算和与Tinney-2算法的比较,表明基于遗传算法的节点优化编号方法能够找到更加优化的编号方式,从而提高了矩阵运算的效率。

References

[1]  Tinney W, Brandwajn V,Chan S M.Sparse vector methods[J].IEEE Trans on Power Apparatus and Systems,1985,104(6):1301-1306.
[2]  Gomez,Antonio,Franquelo,et al.Efficient ordering algorithm to improve sparse vector methods[J].IEEE Trans on Power Systems,1988,3(3):1538-1544.
[3]  Dorigo M,Gambardella L M.Ant colony system:a cooperative learning approach to the traveling salesman problem[J].IEEE Trans on Evolutionary Computations,1997,1(1):53-56.
[4]  赵宏立,庞小红,吴智铭.基因块编码的并行遗传算法及其在TSP中的应用[J].上海交通大学学报,2004,38(S1):213-217.
[5]  Zhao Hongli,Pang Xiaohong,Wu Zhiming.Building block coded parallel genetic algorithm and its application in TSP[J].Journal of Shanghai Jiaotong University,2004,38(S1):213-217(in Chinese).
[6]  张伯明,陈寿孙.高等电力网络分析[M].北京:清华大学出版社,1996.
[7]  Hakavik B,Holen A T.Power system modelling and sparse matrix operations using object-oriented programming[J].IEEE Trans on Power Systems,1994,9(2):1045-1051.
[8]  Fogel D.Applying evolutionary programming to selected travelling salesman problems[J].Cybernetics and System,1993,24(1):27-36.
[9]  玄光男(日).遗传算法与工程设计[M].北京:科学出版社,2000.
[10]  Fonseca C M,Fleming P J.An overview of evolutionary algorithms in multi-objective optimization[J].Evolutionary Computation,1995, (3):11-16.
[11]  曹一家,程时杰.进化算法在工程应用中的若干实用技术[J].电力系统自动化,2001,25(1):62-65.
[12]  Cao Yijia,Cheng Shijie.Some practical techniques for engineering applications of evolutionary algorithms[J].Automation of Electric Power Systems,2001,25(1):62-65(in Chinese).
[13]  石立宝,徐国禹.一种求解电网多目标模糊优化运行的自适应进化规划算法[J].中国电机工程学报,2001,21(3):31-36.
[14]  Shi Libao,Xu Guoyu.A self-adaptive evolutionary programming algorithm of multi-objective fuzzy optimal operation[J].Proceedings of the CSEE,2001,21(3):31-36(in Chinese).
[15]  廖怀庆,单渊达,吴杰.基于拓扑扩展和矩阵增广的复杂配电网络三相不对称系统快速潮流算法[J].电网技术,2001,25(7):36-40.
[16]  Liao Huaiqing,Shan Yuanda,Wu Jie.Topological extension and augmented matrix based method for solution of complicated distribution load flow[J].Power System Technology,2001,25(7):36-40(in Chinese).
[17]  朱凌志,安宁.基于二维链表的稀疏矩阵在潮流计算中的应用[J].电网技术,2005,29(8):51-55.
[18]  Zhu Lingzhi,An Ning.Application of two-dimensional chain table based sparse matrix in power flow calculation[J].Power System Technology,2005,29(8):51-55(in Chinese).
[19]  何洋,洪潮,陈昆薇.稀疏向量技术在静态安全分析中的应用[J].中国电机工程学报,2003,23(1):41-44.
[20]  He Yang,Hong Chao,Chen Kunwei.Study of sparse vector techniques applied to contingency analysis[J].Proceedings of the CSEE,2003,23(1):41-44(in Chinese).
[21]  Freris L L,Sasson A M.Investigation of the load flow problem [J].Proceeding of IEE,1968,115(10):1459-1470.
[22]  Tinney W,Walker J.Direct solutions of sparse network equations by optimally ordered triangular factorization[J].Proceedings of the IEEE,1967,55(11):1801-1809.
[23]  Alsac O,Stott B,Tinney W.Sparsity-oriented compensation methods for modified network solutions[J].IEEE Trans on Power Apparatus and Systems,1983,102(5):1050-1060.
[24]  . 蔡超豪,蔡元宇.机组优化组合的遗传算法[J].电网技术,1997,21(1):44-47.
[25]  Cai Chaohao,Cai Yuanyu.Optimization of unit commitment by genetic algorithm[J].Power System Technology,1997,21(1):44-47(in Chinese).
[26]  张奭,秦浩,刘增基.基于禁忌搜索算法求解全光网路由和波长分配问题[J].计算机学报,2004,27(3):302-309.
[27]  Zhang Shi,Qin Hao,Liu Zengji.Routing and wavelength assignment in all-optical network using Tabu-search algorithm[J].Chinese Journal of Computers,2004,27(3):302-309(in Chinese).
[28]  叶亚斌,张汉一,秦涛,等.利用遗传算法改进的路由和波长分配算法[J].清华大学学报(自然科学版),2002,42(7):863-865.
[29]  Ye Yabin,Zhang Hanyi,Qin Tao,et al.Routing and wavelength assignment algorithms improved by genetic algorithms[J].Journal of Tsinghua University(Science and Technology),2002,42(7): 863-865 (in Chinese).

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133