Transmission network optimal planning using the tabu search method

Abstract

A new method is presented in this paper to solve the single stage (horizon year) optimal planning problem for a transmission network, given future generation and load demands, and alternative types of lines available, subject to overload and right-of-way constraints. The problem is formulated as a 0–1 integer programming problem, and an efficient solving approach based upon the tabu search (TS) method is developed. TS has emerged as a new, highly efficient, search paradigm for quickly finding high quality solutions to combinatorial optimization problems. It is characterized by gathering knowledge during the search, and subsequently profiting from this knowledge. TS is inherently suitable for the transmission network optimal planning problem, because a one-to-one mates is matched between the optimal planning procedure and the TS algorithm, which is then tuned for maximum algorithmic efficiency. In addition, a refined version of the TS method is utilized so as to find multiple optimal planning schemes for some planning problems. The research results for three test systems have verified the feasibility and efficiency of the developed TS based transmission network optimal planning method.