Computing the Minimum Cost Pipe Network Interconnecting One Sink and Many Sources

In this paper, we study the problem of computing the minimum cost pipe network interconnecting a given set of wells and a treatment site, where each well has a given capacity and the treatment site has a capacity that is no less than the sum of all the capacities of the wells. This is a generalized Steiner minimum tree problem which has applications in communication networks and in groundwater treatment. We prove that there exists a minimum cost pipe network that is the minimum cost network under a full Steiner topology. For each given full Steiner topology, we can compute all the edge weights in linear time. A powerful interior-point algorithm is then used to find the minimum cost network under this given topology. We also prove a lower bound theorem which enables pruning in a backtrack method that partially enumerates the full Steiner topologies in search for a minimum cost pipe network. A heuristic ordering algorithm is proposed to enhance the performance of the backtrack algorithm. We then define the notion of k-optimality and present an efficient (polynomial time) algorithm for checking 5-optimality. We present a 5-optimal heuristic algorithm for computing good solutions when the problem size is too large for the exact algorithm. Computational results are presented.

[1]  Denton E. Hewgill,et al.  Exact Computation of Steiner Minimal Trees in the Plane , 1986, Inf. Process. Lett..

[2]  Jianzhong Zhang,et al.  A Bilevel Programming Method for Pipe Network Optimization , 1996, SIAM J. Optim..

[3]  Michael L. Overton,et al.  Two Heuristics for the Steiner Tree , 1996 .

[4]  Michael J. Todd,et al.  Self-Scaled Barriers and Interior-Point Methods for Convex Programming , 1997, Math. Oper. Res..

[5]  Frank Harary,et al.  Graph Theory , 2016 .

[6]  A. Conn,et al.  A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances , 1980 .

[7]  Knud D. Andersen.  An Efficient Newton Barrier Method for Minimizing a Sum of Euclidean Norms , 1993, SIAM J. Optim..

[8]  Prabhata K. Swamee,et al.  Explicit Equations for Pipe-Flow Problems , 1976 .

[9]  David E. Dougherty,et al.  Design Optimization for Multiple Management Period Groundwater Remediation , 1996 .

[10]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[11]  E. Gilbert.  Minimum cost communication networks , 1967 .

[12]  Pawel Winter,et al.  An algorithm for the steiner problem in the euclidean plane , 1985, Networks.

[13]  Sita Bhaskaran.  Optimal design of gas pipeline networks [microform] , 1978 .

[14]  Paul H. Calamai,et al.  A projected newton method forlp norm location problems , 1987, Math. Program..

[15]  Z. A. Melzak.  On the Problem of Steiner , 1961, Canadian Mathematical Bulletin.

[16]  Yinyu Ye,et al.  An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications , 1997, SIAM J. Optim..

[17]  D. H. Lee,et al.  Low cost drainage networks , 1976, Networks.

[18]  David S. Johnson,et al.  The Complexity of Computing Steiner Minimal Trees , 1977 .

[19]  Martin Zachariasen,et al.  Euclidean Steiner minimum trees: An improved exact algorithm , 1997 .

[20]  Q. Feng,et al.  On better heuristic for Euclidean Steiner minimum trees , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[21]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[22]  Sita Bhaskaran,et al.  Optimal Design of Gas Pipeline Networks , 1979 .

[23]  F. K. Hwang,et al.  A primer of the Euclidean Steiner problem , 1991, Ann. Oper. Res..

[24]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[25]  Ding-Zhu Du,et al.  An approach for proving lower bounds: solution of Gilbert-Pollak's conjecture on Steiner ratio , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[26]  Michael L. Overton,et al.  A quadratically convergent method for minimizing a sum of euclidean norms , 1983, Math. Program..