Optimal design of water networks involving multiple contaminants for global water operations

This work presents the development of a systematic technique to target the minimum fresh water consumption and wastewater generation to achieve maximum water recovery (MWR) for systems involving multiple contaminants. A generic linear programing (LP) model has been developed based on water network s...

Full description

Saved in:
Bibliographic Details
Published in:Asia-Pacific journal of chemical engineering 2011-09, Vol.6 (5), p.771-777
Main Authors: Bahiyah Handani, Zainatul, Wan Alwi, Sharifah Rafidah, Hashim, Haslenda, Abdul Manan, Zainuddin, Sayid Abdullah, Sharifah Hanis Yasmin
Format: Article
Language:English
Subjects:
Chemical engineering
Contaminants
Design engineering
Fresh water
mathematical modeling
maximum water recovery
multiple contaminants
Networks
Optimization
superstructure representation
Superstructures
Waste water
water minimization
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This work presents the development of a systematic technique to target the minimum fresh water consumption and wastewater generation to achieve maximum water recovery (MWR) for systems involving multiple contaminants. A generic linear programing (LP) model has been developed based on water network superstructure to simultaneously set the targets and design the MWR network, for both mass transfer‐based (MTB) and non‐mass transfer‐based (NMTB) problems (i.e. global water‐using operations). This work also includes cases where fresh water concentrations for all contaminants are assumed to be either zero or non‐zero. The proposed method is superior since it can guarantee a global optimal solution. Application of the methodology on three case studies shows significant water savings, illustrating the effectiveness of the proposed approach. Copyright © 2011 Curtin University of Technology and John Wiley & Sons, Ltd.
ISSN:1932-2135
1932-2143
1932-2143
DOI:10.1002/apj.556