基于萤火虫算法的电网节点编号优化  

Researches on the Grid Node Numbering Optimization Based on the Firefly Algorithm

作　　者：秦煜森 胡凌 青志明 冯伊娜 

机构地区：[1]国网重庆市电力公司南岸供电分公司,重庆401336 [2]重庆渝电监理公司,重庆400000 [3]国网重庆市电力公司技能培训中心,重庆400053

出　　处：《重庆理工大学学报（自然科学）》2017年第11期198-203,共6页Journal of Chongqing University of Technology：Natural Science

基　　金：国家自然科学基金资助项目(51177112)

摘　　要：在现代电力系统中,伴随着各类电力电子元件如整流器、逆变器、晶闸管,非线性元件如串并联电容器、同异步电动机、各种无功消耗的家用器件的普及和发展,谐波问题愈加严重,成为电力系统中影响电能质量的关键之一。在电力网络问题的求解中,对节点导纳矩阵的求解,就是对节点编号进行组合优化的过程,因此可以使用群智能算法进行求解。电力网络中的节点编号问题是一个组合优化问题,类似于经典的TSP问题。要求得其最优解较困难,目前已知的编号优化方法包括传统编号优化法和运用萤火虫算法的编号优化法。由程序仿真对比结果可知:将萤火虫算法所找到的最优编号引入的非零元数目比传统算法更少、结果更优。In modern power system,with all kinds of power electronic components such as rectifier,inverter,thyristor,nonlinear components such as series parallel capacitor,with asynchronous motor,all kinds of reactive power consumption of popularization and development of household devices,harmonic problem increasingly serious,which has become one of the key to influence the power quality in power system. In solving problems in the electric power network,in view of the node admittance matrix of the solving process,it is the process of combinatorial optimization of node number,so you can use the swarm intelligence algorithm to solve. The node numbering problem in the power network is a combinatorial optimization problem,which is similar to the classic TSP problem.For the optimal solution is difficult,the serial number of known,there are many types of optimization methods,including the serial number of traditional optimization methods and to use the serial number of the firefly algorithm optimization method. Simulation results show that the optimal number of nonzero yuan is less than the traditional algorithm,and the results are better.

关 键 词：节点 稀疏技术 TSP问题 萤火虫算法 优化问题 

分 类 号：TM711[电气工程—电力系统及自动化]