Optimal layout of tree networks using Genetic Algorithms

Two alternative Genetic Algorithm methods for the optimal selection of the layout and connectivity of a dendritic pipe network are presented and compared. Both methods assume that the layout is selected from a directed base graph defining all feasible arcs. The first method uses a conventional binary string to represent the network layout, with the second method using a more efficient integer representation. Comparison with an exact Dynamic Programming formulation is made. The Genetic Algorithm techniques are shown to be very effective search procedures for the class of network optimization problem investigated.