DocumentCode :
403393
Title :
Routing transmission lines via Steiner trees
Author :
Coulston, Chris ; Weissbach, Robert
Author_Institution :
Dept. of Electr. & Comput. Eng., Penn State Erie, PA, USA
Volume :
3
fYear :
2003
fDate :
13-17 July 2003
Abstract :
A novel Steiner tree problem and algorithmic solution are presented in which the Euclidean plane is partitioned into hexagonal cells, each cell having an associated cost traverse. The goal is to minimize the cost required to connect together a set of specified given points. The applications of this problem to power transmission and distribution are presented along with a genetic algorithm, which quickly generates high quality solutions.
Keywords :
genetic algorithms; power distribution planning; power system interconnection; power transmission lines; trees (electrical); Euclidean plane; Steiner trees; genetic algorithm; hexagonal cells; interconnection power system; power distribution planning; routing transmission lines; Cost function; Joining processes; Partitioning algorithms; Power system interconnection; Power system planning; Power transmission lines; Routing; Steiner trees; Substations; Transmission lines;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Power Engineering Society General Meeting, 2003, IEEE
Print_ISBN :
0-7803-7989-6
Type :
conf
DOI :
10.1109/PES.2003.1267390
Filename :
1267390
Link To Document :
بازگشت