Volume 7, Issue 2 (June 2009)
IJCE 2009, 7(2): 109-123 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Afshar M, Afshar A, Mariño M A, ASCE H M. An Iterative Penalty Method for the Optimal Design of Pipe Networks. IJCE 2009; 7 (2) :109-123
URL: http://ijce.iust.ac.ir/article-1-216-en.html
URL: http://ijce.iust.ac.ir/article-1-216-en.html
Abstract: (9842 Views)
This paper presents the application of an iterative penalty method for the design of water distribution pipe
networks. The optimal design of pipe networks is first recasted into an unconstrained minimization problem via the use
of the penalty method, which is then solved by a global mathematical optimization tool. The difficulty of using a trial
and error procedure to select the proper value of the penalty parameter is overcome by an iterative use of the penalty
parameter. The proposed method reduces the original problem with a priori unknown penalty parameter to a series of
similar optimization problems with known and increasing value of the penalty parameters. An iterative use of the
penalty parameter is then implemented and its effect on the final solution is investigated. Two different methods of
fitting, namely least squares and cubic splines, are used to continuously approximate the discrete pipe cost function
and are tested by numerical examples. The method is applied to some benchmark examples and the results are
compared with other global optimization approaches. The proposed method is shown to be comparable to existing
global optimization methods.
Type of Study: Research Paper |
| Rights and permissions | |
 |
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |
