##
**Design optimization of wastewater collection networks by PSO.**
*(English)*
Zbl 1155.90335

Summary: Optimal design of wastewater collection networks is addressed in this paper by making use of the so-called PSO (Particle Swarm Optimization) technique. This already popular evolutionary technique is adapted for dealing both with continuous and discrete variables as required by this problem. An example of a wastewater collection network is used to show the algorithm performance and the obtained results are compared with those given by using dynamic programming to solve the same problem under the same conditions. PSO is shown to be a promising method to solve optimal design problems regarding, in particular, wastewater collection networks, according to the results herein obtained.

### MSC:

90B10 | Deterministic network models in operations research |

90C59 | Approximation methods and heuristics in mathematical programming |

### Keywords:

particle swarm optimization; wastewater collection networks; optimal design; dynamic programming; evolutionary method### Software:

SWMM5
PDFBibTeX
XMLCite

\textit{J. Izquierdo} et al., Comput. Math. Appl. 56, No. 3, 777--784 (2008; Zbl 1155.90335)

Full Text:
DOI

### References:

[1] | Elimam, A. A.; Charalambous, C., Optimum design of large sewer networks, Journal of Environmental Engineering, 115, 6, 1171-1190 (1989) |

[2] | Rodríguez, J. B.M., Optimización del diseño de redes y sistemas de alcantarillado, Revista Ingeniería Hidráulica, 4, 119-129 (1983) |

[3] | A. Botrous, I. El-Hattab, M. Dahab, Design of wastewater collection networks using dynamic programming optimization technique, in: Procs. Of the ASCE Nat. Conf. on Environmental and pipeline Engineering, Kansas City, MO, United States, American Society of Civil Engineers, 2000, pp. 503-512; A. Botrous, I. El-Hattab, M. Dahab, Design of wastewater collection networks using dynamic programming optimization technique, in: Procs. Of the ASCE Nat. Conf. on Environmental and pipeline Engineering, Kansas City, MO, United States, American Society of Civil Engineers, 2000, pp. 503-512 |

[4] | Desher, D. P.; Davis, P. K., Designing sanitary sewers with microcomputers, Journal of Environmental Engineering, 112, 6, 993-1007 (1986) |

[5] | Swamee, P. K., Design of Sewer Line, Journal of Environmental Engineering, 127, 9, 776-781 (2001) |

[6] | Liang, L. Y.; Thompson, R. G., Optimising the design of sewer networks using genetic algorithms and tabu search, Engineering, Construction and Architectural Management, 11, 2, 101-112 (2004) |

[7] | Afshar, M. H., Partially constrained ant colony optimization algorithm for the solution of constrained optimization problems: Application to storm water network design, Advances in Water Resources, 30, 4, 954-965 (2007) |

[8] | Rossman, L., Storm Water Management Model user’s manual (version 5.0) (2005), U. S. E. P. Agency: U. S. E. P. Agency Cincinati (United States) |

[9] | Kennedy, J.; Eberhart, R. C., Particle swarm optimization, (IEEE International Conference on Neural Networks, Perth, Australia (1995), IEEE Service Center: IEEE Service Center Piscataway, NJ), 1942-1948 |

[10] | Eberhart, R.; Kennedy, J., A new optimizer using particle swarm theory, (Proc. 6th Int Symposium on Micro Machine and Human Science (1995), Nagoya: Nagoya Japan), 39-43 |

[11] | Jin, Y. X.; Cheng, H. Z., New discrete method for particle swarm optimization and its application in transmission network expansion planning, Electric Power Systems Research, 77, 3-4, 227-233 (2007) |

[12] | Liao, C. J.; Chao-Tang, T., A discrete version of particle swarm optimization for flowshop scheduling problems, Computers and Operations Research, 34, 10, 3099-3111 (2007) · Zbl 1185.90083 |

[13] | Montalvo, I.; Izquierdo, J.; Pérez, R.; Tung, M., Particle Swarm Optimization applied to the design of water supply systems, Computers and Mathematics with Applications, 56, 3, 769-776 (2008) · Zbl 1155.90486 |

[14] | X.H. Shi, Y.C. Liang, et al., Particle swarm optimization-based algorithms for TSP and generalized TSP, Information Processing Letters, (2007) (in press). Corrected Proof; X.H. Shi, Y.C. Liang, et al., Particle swarm optimization-based algorithms for TSP and generalized TSP, Information Processing Letters, (2007) (in press). Corrected Proof · Zbl 1187.90238 |

[15] | Millonas, M. M.; Swarms, phase transition, and collective intelligence, (Langton, C. G., Artificial Life III (1994), Addison Wesley: Addison Wesley Massachusetts), 417-445 |

[16] | Y.F. Shi, R.C. Eberhart, A modified particle swarm optimizer, in: IEEE International Conference on Evolutionary Computation, 1998, pp. 69-73; Y.F. Shi, R.C. Eberhart, A modified particle swarm optimizer, in: IEEE International Conference on Evolutionary Computation, 1998, pp. 69-73 |

[17] | Voss, M. S., Social programming using functional swarm optimization, (IEEE Swarm Intelligence Symposium (2003), Indiana: Indiana USA), 103-109 |

[18] | B. Al-kazemi, C.K. Mohan, Multi-phase discrete particle swarm optimization, in: Fourth International Workshop on Frontiers in Evolutionary Algorithms, 2002; B. Al-kazemi, C.K. Mohan, Multi-phase discrete particle swarm optimization, in: Fourth International Workshop on Frontiers in Evolutionary Algorithms, 2002 |

[19] | Fung, R. Y.K.; Tang, J. F.; Wang, D., Extension of a hybrid genetic algorithm for nonlinear programming problems with equality and inequality constraints, Computers and Operations Research, 29, 261-274 (2002) · Zbl 1091.90085 |

[20] | Y.F. Shi, R.C. Eberhart, Parameter selection in particle swarm optimization, in: Proc. of the 7th Annual Conf. on Evolutionary Programming, 1998, pp. 591-600; Y.F. Shi, R.C. Eberhart, Parameter selection in particle swarm optimization, in: Proc. of the 7th Annual Conf. on Evolutionary Programming, 1998, pp. 591-600 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.