N. A. Tuan, L. D. Muu and P. C. Duong

Abstract

       We describe a decomposition algorithm for finding a global optimal solution of a looped water distribution network. The proposed method is a branch and bound procedure using an adaptive rectangular bisection. As an application we use our method to find optimal diameter of the pipes in the planned water distribution network in Hanoi, which has been previously considered by several authors. An application to optimal expansion of the existing water network of NewYork City is also discussed. The solutions obtained by this method are better than any solution so far presented in the literature.