Cost-based design of wastewater network optimal topology

Abstract An optimal water network is an oriented graph, starting with the inlet contaminant free unit operations. When the supply water is available from diverse sources and, accordingly, has different level of pollutants contamination, the associated graph remains oriented, but the starting unit operations are lumped and assigned to proper water source based upon their input concentration restrictions. A cost-based optimisation criterion is used to find the optimum water network topology which reduces both the investment (piping network cost, built using the optimum pipes’ diameter) and operating (pumping) costs, when water sources with or without multiple contaminants are used jointly. This topology is compared against the best topology found using supply water minimization as optimisation criterion. In both cases, the optimisation is carried out using an improved genetic algorithm (GA) variant, which guarantees the observation, in the same time, of both the minimum cost and the overall restrictions. Finding the optimal solution is not simple, since the unknowns’ number outcomes the equations’ number. The GA works with chromosomes based upon all internal flows coded as genes. The restrictions are handled during the population generation, simply eliminating the genes outside the feasible domain. The individuals are selected for interbreeding according to their frequency of selection, using one-point crossover method, and then mutation is applied to randomly selected ones.

[1]  Efstratios N. Pistikopoulos,et al.  Generalized modular representation framework for process synthesis , 1996 .

[2]  Valentin Plesu,et al.  Optimal water system topology through genetic algorithm under multiple contaminated-water sources constraint , 2004 .

[3]  Xiao Feng,et al.  Design of Water Network with Internal Mains for Multi-contaminant Wastewater Regeneration Recycle , 2004 .

[4]  Antonis C. Kokossis,et al.  Wastewater minimisation of industrial systems using an integrated approach , 1998 .

[5]  M. V. Pilipovik,et al.  Assessing the water requirements in refineries using possibilistic programming , 2006 .

[6]  Jirí Jaromír Klemes,et al.  Water and wastewater minimisation study of a citrus plant , 2003 .

[7]  W. Seider,et al.  New structure and design methodology for water networks , 2001 .

[8]  Helen H. Lou,et al.  Synthesis of an optimal wastewater reuse network , 2000 .

[9]  Klaus D. Timmerhaus,et al.  Plant design and economics for chemical engineers , 1958 .

[10]  Tai-yong Lee,et al.  Robust Optimal Design of Wastewater Reuse Network of Plating Process , 2002 .

[11]  Miguel J. Bagajewicz,et al.  On the necessary conditions of optimality of water utilization systems in process plants with multiple contaminants , 2003 .

[12]  Xiao Feng,et al.  Cost Optimization of Industrial Wastewater Reuse Systems , 2004 .

[13]  V. Manousiouthakis,et al.  Automatic synthesis of mass-exchange networks with single-component targets , 1990 .

[14]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[15]  Miguel J. Bagajewicz,et al.  A review of recent design procedures for water networks in refineries and process plants , 2000 .

[16]  Mariano J. Savelski,et al.  On zero water discharge solutions in the process industry , 2004 .

[17]  Miguel J. Bagajewicz,et al.  On the optimality conditions of water utilization systems in process plants with single contaminants , 2000 .

[18]  Fernando L.P. Pessoa,et al.  Design procedure for water/wastewater minimization: single contaminant , 2007 .

[19]  Nick Hallale,et al.  A NEW GRAPHICAL TARGETING METHOD FOR WATER MINIMISATION , 2002 .

[20]  Valentin Plesu,et al.  Genetic algorithm optimisation of water consumption and wastewater network topology , 2005 .

[21]  Mahmoud M. El-Halwagi,et al.  Synthesis of optimal heat-induced separation networks , 1995 .

[22]  Vasilios Manousiouthakis,et al.  Variable target mass‐exchange network synthesis through linear programming , 1996 .