Premium
Identification of heat load loops and downstream paths in heat exchanger networks
Author(s) -
Zhu J.,
Han Z.,
Rao M.,
Chuang K. T.
Publication year - 1996
Publication title -
the canadian journal of chemical engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.404
H-Index - 67
eISSN - 1939-019X
pISSN - 0008-4034
DOI - 10.1002/cjce.5450740609
Subject(s) - operability , downstream (manufacturing) , heat exchanger , adjacency matrix , identification (biology) , computer science , adjacency list , topology (electrical circuits) , node (physics) , graph , tree (set theory) , mathematics , graph theory , combinatorics , algorithm , engineering , physics , ecology , biology , thermodynamics , operations management , software engineering , structural engineering
To achieve the optimal trade‐off between economies and operability, simplifications of heat exchanger networks (HENs) are required. To do so, identifications of heat load loops and downstream paths are necessary. This paper proposes new methods for identifications of independent and dependent loops as well as downstream paths in HENs, respectively. Stream table and node adjacency matrix are defined in this paper to represent the structures of HENs. Based on graph theory, identification of loops in HENs is decomposed into three procedures: (a) finding a maximal tree, (b) identifying a maximal set of independent loops and (c) searching all loops. Locating the downstream paths in HENs is accomplished by finding directed trees which are generated by modifying the procedure for finding a maximal tree. A complex network with a splitting stream is used for detailed illustrations of the procedures.