Abstract:

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.

Key words: Route planning, tabu search algorithm, spanning neighborhood, two-way search, turning point processing