Routing transmission lines via Steiner trees

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.