Abstract
The identification of independent loops consists of two stages: (a) finding a maximal tree for a network, and (b) obtaining a maximal set of independent loops. The conduction and proof of the proposed algorithm are provided. A new equation for determining the number of independent loops in a HEN is developed. Discussions about the determination of independent loops of HENs with splitting streams are presented. It is shown that to achieve small energy penalty during the simplification of HENs by using loop-breaking, loops which include only cold streams (or only hot streams) should not be excluded from the set of independent loops.
Notes
Leave absence from Shanghai Jiao Tong University, China.
Corresponding author. Tel: (403) 4928250; Fax: (403) 4922881.