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
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
第一层优化是在整个规划区域内，应用遗传算法搜索可能的变电站的遍历顺序；第二层优化是按照第一层优化确定的遍历顺序，应用纲络图论中的最小权匹配算法分别对每一个变电站与其相邻站之间的联络线进行优化。