Global Optimization of Nonlinear Network Design

A novel approach for obtaining globally optimal solutions to design of networks with nonlinear resistances and potential driven flows is proposed. The approach is applicable to networks where the potential loss on an edge in the network is governed by a convex and strictly monotonically increasing function of flow rate. We introduce a relaxation of the potential loss constraint and formulate the design problem as a mixed-integer nonlinear program. A linearization-based approach with tailored cuts is proposed that improves the computational efficiency over a standard implementation. We have also implemented a simple heuristic approach for finding feasible solutions at the root node and during the search process. The algorithm has been implemented with IBM-ILOG CPLEX and is shown to be computationally effective on a number of examples from the literature.

[1]  Gérard Cornuéjols,et al.  A Feasibility Pump for mixed integer nonlinear programs , 2009, Math. Program..

[2]  U. Shamir,et al.  Design of optimal water distribution systems , 1977 .

[3]  D. B. Khang,et al.  A two‐phase decomposition method for optimal design of looped water distribution networks , 1990 .

[4]  I. Grossmann,et al.  An LP/NLP based branch and bound algorithm for convex MINLP optimization problems , 1992 .

[5]  I. Goulter,et al.  Implications of Head Loss Path Choice in the Optimization of Water Distribution Networks , 1986 .

[6]  Jeffery L. Kennington,et al.  Solving the Pipe Network Analysis Problem Using Optimization Techniques , 1978 .

[7]  Fred W. Glover,et al.  The feasibility pump , 2005, Math. Program..

[8]  N. S. Barnett,et al.  Private communication , 1969 .

[9]  Jeff T. Linderoth,et al.  FilMINT: An Outer-Approximation-Based Solver for Nonlinear Mixed Integer Programs , 2008 .

[10]  Andrea Lodi,et al.  A storm of feasibility pumps for nonconvex MINLP , 2012, Mathematical Programming.

[11]  Gérard Cornuéjols,et al.  An algorithmic framework for convex mixed integer nonlinear programs , 2008, Discret. Optim..

[12]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[13]  Olvi L. Mangasarian,et al.  Nonlinear Programming , 1969 .

[14]  Bruce N. Janson,et al.  A common network flow formulation for several civil engineering problems , 1984 .

[15]  Jorge Nocedal,et al.  Knitro: An Integrated Package for Nonlinear Optimization , 2006 .

[16]  A. Cenedese,et al.  Optimal design of water distribution networks , 1978 .

[17]  A. Lodi,et al.  Water Network Design by MINLP , 2008 .

[18]  E. Balas,et al.  Canonical Cuts on the Unit Hypercube , 1972 .

[19]  Lorenz T. Biegler,et al.  On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006, Math. Program..

[20]  Kaj Madsen,et al.  Optimization of pipe networks , 1991, Math. Program..

[21]  Pierre Bonami,et al.  Heuristics for convex mixed integer nonlinear programs , 2012, Comput. Optim. Appl..

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

[23]  Dimitri P. Solomatine,et al.  Application of global optimization to the design of pipe networks , 2000 .

[24]  Masayuki Ishii,et al.  Split-Pipe Design of Water Distribution Networks Using a Combination of Tabu Search and Genetic Algorithm , 2007 .

[25]  V. S. Vaidhyanathan,et al.  Transport phenomena , 2005, Experientia.