改进禁忌搜索算法的线路规划算法优化设计  

Optimal Design of Route Planning Algorithm Based on Improved Tabu Search Algorithm

作　　者：李杰 金超未 帕尔哈提·克衣木 罗瑞雪 LI Jie;JIN Chaowei;PAERHATI Keyimu;LUO Ruixue(State Grid Xinjiang Information and Telecommunication Company,Urumqi 830000)

机构地区：[1]国网新疆电力有限公司信息通信公司,乌鲁木齐830000

出　　处：《电气工程学报》2021年第3期130-136,共7页Journal of Electrical Engineering

摘　　要：针对传统输电线路规划效率慢、成本高等问题,结合禁忌搜索算法,根据地理信息因素将规划区划分为不同的单元格,设置邻域函数进行线路搜索得到规划路径。由于输电线路信息数据规模大,算法的效率受到大幅度影响,拐点也会增多,因此对算法进行改造,采用跨越式邻域和双向搜索提高算法的效率,引入方向因子来确保线路能够合并,采用拐点处理机制来减少拐点和迂回的数量,减少了杆塔的使用。以变电站A到变电站B之间的输电线路对算法进行仿真,试验表明,改进后的算法相比之前的算法效率提高了近一倍,成本减少了大约220万元。In view of the slow efficiency and high cost of traditional transmission line planning,the tabu search algorithm is combined by the author to divide the planning area into different cells according to geographic information factors,and the neighborhood function is set to search for the route to obtain the planned route.Due to the large scale of transmission line information data,the efficiency of the algorithm is greatly affected,and the inflection point would increase.Therefore,the algorithm is modified,and the efficiency of the algorithm is improved by using leapfrogging neighborhood and two-way search.Directional factors are introduced to ensure that the lines could be merged.Inflection point processing mechanism to reduce the number of inflection points and detours,thereby the use of poles and towers is reduced.The algorithm is simulated with the transmission line from substation A to substation B.Tests show that the improved algorithm had nearly doubled the efficiency of the previous algorithm and the cost is reduced by approximately 2.2 million RMB.

关 键 词：线路规划 禁忌搜索算法 跨越式邻域 双向搜索 拐点处理 

分 类 号：TM92[电气工程—电力电子与电力传动]