Please use this identifier to cite or link to this item:
|Title:||Power system network partitioning using tabu search||Authors:||Chang, C.S.
|Issue Date:||15-Feb-1999||Citation:||Chang, C.S.,Lu, L.R.,Wen, F.S. (1999-02-15). Power system network partitioning using tabu search. Electric Power Systems Research 49 (1) : 55-61. ScholarBank@NUS Repository.||Abstract:||This paper presents a new algorithm to power system network partitioning based on tabu search (TS). TS is a simple heuristic optimization strategy that can achieve the optimal or near optimal solution within a reasonably short time. A 2-step TS-based algorithm is proposed to divide the system network into several subsystems to optimize the use of parallel computer systems for power system analysis. Test results on two IEEE standard networks are presented and compared with those obtained by other combinatorial optimization approaches, namely: simulated annealing parallel simulated annealing and genetic algorithm. It is shown that the proposed TS-based algorithm has higher efficiency and better convergence than the previously proposed methods. © 1999 Elsevier Science S.A.||Source Title:||Electric Power Systems Research||URI:||http://scholarbank.nus.edu.sg/handle/10635/81004||ISSN:||03787796|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 17, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.