379
Views
22
CrossRef citations to date
0
Altmetric
Research articles

Reliability-based layout design of sewage collection systems in flat areas

&
Pages 790-802 | Received 17 Mar 2014, Accepted 23 Feb 2015, Published online: 13 May 2015

References

  • Afshar, M.H., 2010. A parameter free Continuous Ant Colony Optimization Algorithm for the optimal design of storm sewer networks. Advances in Engineering Software, 41, 188–195.
  • Afshar, M.H., Afshar, A., Marino, M.A., and Darbandi, A.A.S., 2006. Hydrograph-based storm sewer design optimization by genetic algorithm. Canadian Journal of Civil Engineering., 33 (3), 310–325.
  • Diogo, A.F. and Graveto, V.M., 2006. Optimal Layout of Sewer Systems: A Deterministic versus a Stochastic Model. Journal of Hydraulic Engineering, 132 (9), 927–943.
  • Diogo, A.F., Walters, G.A., Sousa, E.R., and Graveto, V.M., 2000. Three-dimensional optimization of urban drainage systems. Computer-Aided Civil and Infrastructure Engineering, 15 (6), 409–426.
  • Haghighi, A., 2013. Loop-by-Loop Cutting Algorithm to Generate Layouts for Urban Drainage Systems. Journal of Water Resources Planning and Management, 139 (6), 693–703.
  • Haghighi, A. and Bakhshipour, A.E., 2012. Optimization of Sewer Networks Using an Adaptive Genetic Algorithm. Water Resources Management, 26, 3441–3456.
  • Haghighi, A. and Bakhshipour, A.E., 2015. Deterministic Integrated Optimization Model for Sewage Collection Networks Using Tabu Search. Journal of Water Resources Planning and Management, 141 (1), 04014045.
  • Li, G.Y., 1986. The optimal design of sewer networks by DDDP. China Water Supply and Sewerage, Beijing, People's Republic of China, 2 (2), 18–23.
  • Li, G. and Matthew, R.G.S., 1990. New approach for optimization of urban drainage system. Journal of Environmental Engineering, 116 (5), 927–944.
  • Liang, L.Y., Thompson, R.G., and Young, D.M., 2004. Optimizing the design of sewer networks using genetic algorithms and tabu search. Engineering Construction and Architectural Management, 11 (2), 101–112.
  • Kirkpatrick, S., Gelatt, C.D., and Vecchi, M.P., 1983. Optimization by simulated annealing. Science, 220, 671–680.
  • Mays, L.W., Wenzel, H.G., and Liebman, J.C., 1976. Model for layout and design of sewer systems. Journal of Water Resources Planning and Management, 102 (2), 385–405.
  • Mays, L.W. and Yen, B.C., 1975. Optimal cost design of branched sewer system. Water Resources Research, 11 (1), 37–47.
  • Minieka, E., 1978. Optimization algorithms for network and graphs. New York: Dekker, Marcel, Inc.
  • Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., and Teller, E., 1953. Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21 (6), 1087–1092.
  • Pan, T.C. and Kao, J.J., 2009. GA-QP model to optimize sewer system design. Journal of Environmental Engineering, 135 (1), 17–24.
  • Rao, S.S., 2009. Engineering Optimization Theory and Practice. Hoboken, NJ: John Wiley & Sons.
  • Tekel, S. and Belkaya, H., 1986. Computerized layout generation for sanitary sewers. Journal Environmental Engineering, 112 (4), 500–515.
  • Walters, G.A. and Lohbeck, T., 1993. Optimal layout of tree networks using genetic algorithms. Engineering Optimization, 22, 27–48.
  • Walters, G.A. and Smith, D.K., 1995. Evolutionary design algorithm for optimal layout of tree networks. Engineering Optimization, 24, 261–281.
  • Van, P.J. and Aarts, E.H., 1987. Simulated Annealing: Theory and Applications. New York: Springer.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.