摘要
城市中压配电网联络线优化的过程中,不同的变电站遍历顺序,可能带来不同的联络线优化方案。针对这一问题提出一种全局优化同局部优化相结合的双层优化方法。第一层优化是在整个规划区域内,应用遗传算法搜索可能的变电站的遍历顺序;第二层优化是按照第一层优化确定的遍历顺序,应用网络图论中的最小权匹配算法分别对每一个变电站与其相邻站之间的联络线进行优化。最后以规划区内所有联络线总投资费用最小的方案作为最终的联络方案。根据本文算法开发了相应的软件,通过计算规划实例,得出了满意的联络方案,表明算法有效。
During the optimization of the tie lines for urban medium voltage distribution network, different traverse of the transformer substations will bring different results. A new method combined global and local optimization is proposed. Three steps of the method are：first, genetic algorithm is adopted in the whole planning area to hunt the possible traverse sequence of the substations; second, the least weight match algorithm in graph theory is adopted to optimize the tie lines between each substation and its neighbors according to the traverse sequence determined in the first step ;finally, the scheme which has the least cost of investment in tie lines will be taken as the ultimate scheme. Applications are developed based on the algorithm. Test results show that the proposed algorithm is effective.
出处
《电力系统及其自动化学报》
CSCD
北大核心
2005年第6期43-49,共7页
Proceedings of the CSU-EPSA
关键词
配电网络规划
联络线
遗传算法
最小权匹配
distribution network planning
tie lines
genetic algorithm
least weight match algorithm
