A modified genetic algorithm (GA) is proposed for water distribution networ
k optimization. Several changes are introduced in the selection and mutatio
n processes of a simple GA. In each generation a constant number of solutio
ns is eliminated, the selected ones are ranked for crossover, and the new s
olutions are allowed to undergo at most one mutation. All these modificatio
ns greatly increase the algorithm convergence. The modified GA is tested on
the New York City water supply expansion problem. It obtains the lowest-co
st feasible solution reported in the literature in far fewer generations th
an any previous GA.