Show simple item record

contributor authorShoou‐Yuh Chang
contributor authorShu‐Liang Liaw
date accessioned2017-05-08T21:06:09Z
date available2017-05-08T21:06:09Z
date copyrightSeptember 1990
date issued1990
identifier other%28asce%290733-9372%281990%29116%3A5%28910%29.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/38742
description abstractA wastewater‐treatment system can be represented by a multistage configuration consisting of a variety of unit processes from various stages. The number of treatment combinations may be very large when the number of unit processes in a stage and the number of stages in a system increase. Enumeration techniques, e.g., total enumeration and implicit enumeration, have been used to eliminate infeasible treatment combinations and to identify the least‐cost treatment system. A bounded implicit enumeration approach is proposed to make the implicit enumeration more efficient. A lower bound is calculated at each stage and added to the up‐to‐date objective function value to eliminate more combinations before reaching the final stage. The results for two wastewater‐treatment‐system‐synthesis models indicate that the bounded implicit enumeration is consistently more efficient than the total and implicit enumeration approaches in identifying least‐cost and feasible treatment alternatives.
publisherAmerican Society of Civil Engineers
titleBounded Implicit Enumeration for Wastewater‐Treatment Systems
typeJournal Paper
journal volume116
journal issue5
journal titleJournal of Environmental Engineering
identifier doi10.1061/(ASCE)0733-9372(1990)116:5(910)
treeJournal of Environmental Engineering:;1990:;Volume ( 116 ):;issue: 005
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record