Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/62893
Title: Transmission network optimal planning using the tabu search method
Authors: Wen, F. 
Chang, C.S. 
Keywords: Tabu search
Transmission network planning
Issue Date: Aug-1997
Source: Wen, F.,Chang, C.S. (1997-08). Transmission network optimal planning using the tabu search method. Electric Power Systems Research 42 (2) : 153-163. ScholarBank@NUS Repository.
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. © 1997 Elsevier Science S.A.
Source Title: Electric Power Systems Research
URI: http://scholarbank.nus.edu.sg/handle/10635/62893
ISSN: 03787796
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

23
checked on Dec 8, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.