JOURNAL OF CHEMICAL ENGINEERING OF JAPAN
Print ISSN : 0021-9592
Original Papers
An Efficient Decomposition Algorithm for a Weighed Process
Delin QuDengwen SunMasaaki MurakiToyohiko Hayakawa
Author information
JOURNALS FREE ACCESS

1992 Volume 25 Issue 5 Pages 527-532

Details
Abstract

Considering the computation load of process simulation, it is necessary to assign a weight to each stream of a chemical process. Therefore, tearing criteria for the weighed process are proposed, which minimize the number of cut streams (cycle intervals) first and then search for an alternative stream with the minimum weight for each detected cycle interval. Based on them, an efficient decomposition algorithm is then developed, with two parts. One is to detect the cycle interval, using the weighed reachable vector method. The other is to determine the cut stream for each cycle interval through three indispensable procedures (searching, judging and regulating). After searching out an alternative stream with minimum weight, judging is carried out by verifying whether the detected cycle interval is broken or not. Then regulating is implemented by modifying the local weighed adjacency matrix. These three procedures are repeated until the stream with minimum weight is got. Finally, the optimal cut-set is obtained.
Four test problems are examined. The proposed algorithm finds the minimum weighing sum for all these problems under the minimum number of cut streams.

Information related to the author
© 1992 The Society of Chemical Engineers, Japan
Previous article Next article
feedback
Top