Abstract

The genetic algorithm technique is a relatively new optimization technique. In this paper we present a methodology for optimizing pipe networks using genetic algorithms. Unknown decision variables are coded as binary strings. We investigate a three‐operator genetic algorithm comprising reproduction, crossover, and mutation. Results are compared with the techniques of complete enumeration and nonlinear programming. We apply the optimization techniques to a case study pipe network. The genetic algorithm technique finds the global optimum in relatively few evaluations compared to the size of the search space.