.png){kind=icon}
.png){kind=icon}
Return
Power system network partitioning using tabu search
.png){kind=icon}
PRE
AI
DOI：10.1016/S0378-7796(98)00119-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 1999 Elsevier Science S.A. All rights reserved.
Keywords:
tabu search
algorithm
simulated annealing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.2
Papers:
1.1W
Citations:
2.2W
Organization
No organization information available