基于改进模拟植物生长算法的输电网络扩展规划

Plant Growth Simulation Algorithm for Transmission Network Expansion Planning

输电网络规划是一个复杂的组合优化问题,若以选择线路回数为变量抽象出模型,则输电网扩展问题可以归结为一类整数规划问题。对模拟植物生长算法进行改进,形成了适于解整数规划问题的改进模拟植物生长算法,并将此算法应用到电力系统输电网络扩展规划中。为了加快算法收敛,采用了Kruskal算法来获取初始点,提出了一种快速判别网络连通的算法。最后,实例计算结果表明了该方法的可行性。

In order to quicken the convergent speed of the algorithm, this paper used Kruskal algorithm to get the initial node, and presented an algorithm which can distinguish the connectivity of network quickly. The result of the example indicated the validity and possibility of this method. So this paper proposed a new method to solve the transmission network expansion planning problems and some correlative problems.