Optimization of Pipe Networks

Claus Thorp Hansen; Kaj Madsen; Hans Bruun Nielsen

doi:10.1007/BF01582879

Optimization of Pipe Networks

Claus Thorp Hansen, Kaj Madsen, Hans Bruun Nielsen

Research output: Contribution to journal › Journal article › Research › peer-review

Abstract

The paper treats a piping system, where the layout of the network is given but the diameters of the pipes should be chosen among a small number of different values. The cost of realizing the system should be minimized while keeping the energy heads at the nodes above some lower limits. A new algorithm using successive linear programming is presented. The performance of the algorithm is illustrated by optimizing a network with 201 pipes and 172 nodes. It is concluded that the new algorithm seems to be very efficient and stable, and that it always finds a solution with a cost near the best possible

Original language	English
Journal	Mathematical Programming
Volume	52
Issue number	1
Pages (from-to)	45-58
ISSN	0025-5610
DOIs	https://doi.org/10.1007/BF01582879
Publication status	Published - 1991

Keywords

Gas and water distribution networks
Sequential linear programming
Trust regions
Sparse matrix techniques

Access to Document

10.1007/BF01582879

http://www2.imm.dtu.dk/pubdb/p.php?700

OpenUrl availability

Full text

Cite this

@article{81c361a6c5044548b0a5be64b741eea8,

title = "Optimization of Pipe Networks",

abstract = "The paper treats a piping system, where the layout of the network is given but the diameters of the pipes should be chosen among a small number of different values. The cost of realizing the system should be minimized while keeping the energy heads at the nodes above some lower limits. A new algorithm using successive linear programming is presented. The performance of the algorithm is illustrated by optimizing a network with 201 pipes and 172 nodes. It is concluded that the new algorithm seems to be very efficient and stable, and that it always finds a solution with a cost near the best possible",

keywords = "Gas and water distribution networks, Sequential linear programming, Trust regions, Sparse matrix techniques",

author = "Hansen, {Claus Thorp} and Kaj Madsen and Nielsen, {Hans Bruun}",

year = "1991",

doi = "10.1007/BF01582879",

language = "English",

volume = "52",

pages = "45--58",

journal = "Mathematical Programming",

issn = "0025-5610",

publisher = "Springer",

number = "1",

}

TY - JOUR

T1 - Optimization of Pipe Networks

AU - Hansen, Claus Thorp

AU - Madsen, Kaj

AU - Nielsen, Hans Bruun

PY - 1991

Y1 - 1991

N2 - The paper treats a piping system, where the layout of the network is given but the diameters of the pipes should be chosen among a small number of different values. The cost of realizing the system should be minimized while keeping the energy heads at the nodes above some lower limits. A new algorithm using successive linear programming is presented. The performance of the algorithm is illustrated by optimizing a network with 201 pipes and 172 nodes. It is concluded that the new algorithm seems to be very efficient and stable, and that it always finds a solution with a cost near the best possible

AB - The paper treats a piping system, where the layout of the network is given but the diameters of the pipes should be chosen among a small number of different values. The cost of realizing the system should be minimized while keeping the energy heads at the nodes above some lower limits. A new algorithm using successive linear programming is presented. The performance of the algorithm is illustrated by optimizing a network with 201 pipes and 172 nodes. It is concluded that the new algorithm seems to be very efficient and stable, and that it always finds a solution with a cost near the best possible

KW - Gas and water distribution networks

KW - Sequential linear programming

KW - Trust regions

KW - Sparse matrix techniques

U2 - 10.1007/BF01582879

DO - 10.1007/BF01582879

M3 - Journal article

SN - 0025-5610

VL - 52

SP - 45

EP - 58

JO - Mathematical Programming

JF - Mathematical Programming

IS - 1

ER -

Optimization of Pipe Networks

Abstract

Keywords

Access to Document

OpenUrl availability

Fingerprint

Cite this