AN ITERATIVE PENALTY METHOD FOR THE OPTIMAL DESIGN OF PIPE NETWORKS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

AFSHAR M.H.; AFSHAR A.; MARINO M.A.; ASCE H.M.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF CIVIL ENGINEERING Year:2009 | Volume:7 | Issue:2 Page(s): 109-123

Download Full-Text

View:

444

Download:

186

Cites:

Information Journal Paper

Title

AN ITERATIVE PENALTY METHOD FOR THE OPTIMAL DESIGN OF PIPE NETWORKS

Author(s)

AFSHAR M.H. | AFSHAR A. | MARINO M.A. | ASCE H.M. | Issue Writer Certificate

Keywords

PIPE NETWORKS

WATER DISTRIBUTION

DESIGN

OPTIMIZATION

Abstract

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.

Cites

No record.

References

No record.

Cite

APA: Copy

AFSHAR, M.H., AFSHAR, A., MARINO, M.A., & ASCE, H.M.. (2009). AN ITERATIVE PENALTY METHOD FOR THE OPTIMAL DESIGN OF PIPE NETWORKS. INTERNATIONAL JOURNAL OF CIVIL ENGINEERING, 7(2), 109-123. SID. https://sid.ir/paper/271807/en

Vancouver: Copy

AFSHAR M.H., AFSHAR A., MARINO M.A., ASCE H.M.. AN ITERATIVE PENALTY METHOD FOR THE OPTIMAL DESIGN OF PIPE NETWORKS. INTERNATIONAL JOURNAL OF CIVIL ENGINEERING[Internet]. 2009;7(2):109-123. Available from: https://sid.ir/paper/271807/en

IEEE: Copy

M.H. AFSHAR, A. AFSHAR, M.A. MARINO, and H.M. ASCE, “AN ITERATIVE PENALTY METHOD FOR THE OPTIMAL DESIGN OF PIPE NETWORKS,” INTERNATIONAL JOURNAL OF CIVIL ENGINEERING, vol. 7, no. 2, pp. 109–123, 2009, [Online]. Available: https://sid.ir/paper/271807/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops