Distributed Network Optimization Of A Water Supply System, Using Greedy And Genetic Algorithms; A Comparative Analysis

ABSTRACT

Minimum Spanning Tree is one of spanning tree optimization problems having several applications in network design. This study uses greedy and genetic algorithms approaches to solve minimum spanning tree problem of a water supply network system of Michael Okpara University of Agriculture, Urnudike. The algorithm reads both the connection and weight (distance) matrices of a given network, and then searches the minimum spanning path that optimizes the overall distance rooted at a given node. Computational experiment results show that the algorithms gave similar results. The optimal distance obtained was 5151.9 m. The genetic algorithm got to the optimal at the 23 iterations (generations).