期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于粒子群优化算法的电力网络节点编号技术 被引量：1

Power network node ordering technology basd on particle swarm optimization
在线阅读 下载PDF
导出
摘要 对于大规模电网,目前常用的网络节点编号算法还有待进一步改进。针对此现状,提出了基于粒子群优化的网络节点编号优化算法,通过IEEE118和IEEE300节点算例进行了计算,并与现有的节点编号方法比较,证明了该算法的有效性。研究结果表明,该方法具有广阔的推广应用前景。 The node ordering algorithms in common need to further improve, in large scale power grid. Aiming at the problem, a new method of node ordering technology based on particle swarm optimization（PSO） was proposed. The calculation was done, by IEEE 118 and IEEE 300 systems. Compared with existing node ordering technology, its efficiency was demonstrated. The experimental results show that it illustrates a good prospect of application and extension.
作者 王明敏 王建全
机构地区 浙江大学电气工程学院
出处 《机电工程》 CAS 2008年第8期87-89,101,共4页 Journal of Mechanical & Electrical Engineering
关键词 节点编号 粒子群优化算法 稀疏技术 电力系统计算 node ordering particle swarm optimization（PSO） parsity technology power system calculation
分类号 TP301.6 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献12

  • 1TINNEY W, WALKER J. Direct solutions of sparse network equations by optimally ordered triangular factorization [ J ]. Proceedings of the IEEE, 1967,55 ( 11 ) : 1801 - 1809.
  • 2ALSAC O, STOTT B, TINNEY W. Sparsity oriented compensation methods for modified network solutions[ J]. IEEE Transactions on Power Apparatus and Systems, 1983, 102(5) :1050 - 1060.
  • 3TINNEY W, BRANDWAJN V, CHAN S M. Sparse vector methods [ J ]. IEEE Transactions on Power Apparatus and Systems, 1985,104(6) :1301 -1306.
  • 4~OMEZ A, FRANQUELO L G. Node ordering algorithm for parse vector method improvement [ J ]. IEEE Transactions n Power System, 1988,3 ( 1 ) :74 - 80.
  • 5BETANCOURT R. An efficent heuristic ordering alorgrithm for partial matrix refactorization [ J ]. IEEE Transactions on Power System,1988,3(3) :1181 - 1188.
  • 6GOMEZ A, FRANQUELO L G. An efficient ordering algorithm to improve sparse vector mothdods [ J ]. IEEE Transactions on Power Apparatus and Systems, 1988,3 (4): 1538 - 1544.
  • 7ENNS M, TINNEY W, ALVARANDO F L. Sparse matrix inverse factors [ J ]. IEEE Transactions on Power Apparatus and Systems, 1990,5 ( 2 ) :466 - 473.
  • 8LEE Chun-liang, CHEN Nan-ming. Sparse vector method implument via minimum inverse fill-in odering [ J]. IEEE Transactions on Power Systems, 1993,8 ( 1 ) :239 - 245.
  • 9KENNEDY J, EBERHRT R. Particle Swarm Optimization [ C ]//Proceedings of IEEE International Conference on Neural Networks. Perth, Australia, 1995 : 1942 - 1948.
  • 10KENNEDY J, EBERHRT R. A New Optimizer using Particle Swarm Theory [ C ]//Proceeding Sixth International Symposium on Micro Machine and Human Science. IEEE service center, Nagoya, Japan, 1995:39 - 43.

二级参考文献10

  • 1VARELA G N, SINCLAIR M C. Ant colony optimization for virtual--wavelength --path routing and wavelength allocation[A]. Proceedings of the 1999 Congress on Evolutionary Computation [C]. Washington DC: IEEE, 1999. 1809--1816.
  • 2BAUER A, BULLNHEIMER B, HARTL R F, STRAUSSC. An ant colony optimization approach for the single machine total tardiness problem[A]. Proceedings of the 1999 Congresson Evolutionary Computation [C]. Washington DC: IEEE,1999. 1445-- 1450.
  • 3KRIEGER MICHAEL J B, et al. Ant--like task allocation and recruitment in cooperative robots[J]. Nature, 2000,406:39--42.
  • 4HOOGEVEEN J A, LENSTRA J K, VELTMAN B. Preemptive scheduling in a two--stage multiprocessor flow shop is NP--hard[J]. European Journal of Operational Research, 1996,89(1): 172--175.
  • 5DUDEK R A, et al. The lessons of flowshop scheduling research[J]. Operations Research, 1992, 40(1):7--13.
  • 6LINN R, ZHANG Wei, Hybrid flowshop seheduling:a survey[J]. Computers & Industrial Engineering, 1999,37(1-- 2) : 57--61.
  • 7CAMAZINE S, et al. Self--organization in biological systems[M]. Princeton USA: Princeton University Press, 2001.
  • 8BONABEAU E, DORIGO M, THERAULAZ G. Inspiration for optimization from social Insect behavior[J]. Nature, 2000,406:39--42.
  • 9DORIGO M, MANIEZZO V,COLORNI A. Ant system:optimization by a colony of cooperating agents[J]. IEEE Transactions On System Man and Cybernetics B:Cybernetics, 1996,26(1): 29--41.
  • 10DI CARO G, DORGO M. AntNet: distributed stigmergetic control for communications networks[J]. Journal of Artificial Intelligence Research, 1998, 9:317--365.

共引文献51

同被引文献9

  • 1王锡凡,方万良,杜正春.现代电力系统分析[M].北京:科学出版社,2006:57-59.
  • 2倪以信,陈寿孙,张宝霖.电力系统的理论和分析[M].北京:清华大学出版社.2002:304-309.
  • 3TINNEY W F, WALKER J W. Direct solutions of sparse network equations by optimally ordered triangu- lar factorization [ J ]. Proceedings of the IEEE, 1967, 55(11) :1801 - 1809.
  • 4ALSAC O, STOTT B, TINNEY W F. Sparsity-orien- ted compensation methods for modified network solu- tions[ J ]. IEEE Trans on Power Apparatus and Sys- tems,1983,102(5) :1050 - 1060.
  • 5HEGGERNES P, EISENSTAT S C, KUMFERT G, et al. The computational complexity of the minimum de- gree algorithm [J/OL]. https://www, cs. purdue. edu/homes/apothen/md-conf, pdf.
  • 6BETANCOURT R. An efficient heuristic ordering algo- rithm for partial matrix re-factorization [ J ].IEEE Trans on Power Systems,1988,3(3) :1181 -1187.
  • 7GOMEZ A, FRANQUELO L G. Node ordering algo- rithm for sparse vector method improvement [ J ]. IEEE Trans on Power Systems, 1988,3 ( 1 ) :73 - 79.
  • 8GOMEZ A, FRANQUELO L G. An efficient ordering algorithm to improve sparse vector methods [ J ]. IEEE Trans on Power Systems, 1988,3 ( 4 ) : 1538 - 1544.
  • 9郭文忠,陈国龙.离散粒子群优化算法及其优化[M].北京:清华大学出版社,2012.

引证文献1

二级引证文献1

机电工程
2008年 第8期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部