Professional Documents
Culture Documents
Planning of The Calculation For Finding Recycles: Keywords: Planning, Recycle & Serial & Reachability
Planning of The Calculation For Finding Recycles: Keywords: Planning, Recycle & Serial & Reachability
Recycle processes:
Identification of sets:
A unit can be calculated if all its inputs are known either because they are
feeds or because they come from other units which can already calculated.
The unit 1 has only feed stream into it and thus can be calculated. This
makes stream 3 known. Then unit 2 can be calculated because stream 3 is
now known and stream 4 is a feed. But unit 4 cannot yet be calculated
because stream 7 is not known even though streams now known and stream
6 is a feed. There are no more units which can be calculated among those
remaining. Since some units remain uncalculated. There is composed only of
units 1 & 2 has been identified.
1
1 3 5
2 4
3
7
5 2 4
6
8
Fig 3.1: Process Flow Diagram
From table 3.2, If stream 1 & 5 were known only unit 3 could be calculated. But if
stream 2 and 7 were known the entire set could be calculated in the sequence (1, 4 ,
3, 5, 2)
The steam 2 and 7 are recalculated when units 5 and 2 are done so that the assumed
values can be replaced by newly calculated ones and the sequence repeated.
For large recycle sets the number of combinations of streams four or more at a time
would be too large to want an exhaustive search for and arbitrary number of
streams required to be assumed known.
For comparison, the recycle matrix of Lee & Rudd (1966) is applied to the same
recycle set.
There are four loops which are (2, 3) , (7, 8), (1, 4, 2), and (4, 6, 7, 5). These loops
can be represented in the cycle matrix given in the table, where rank of a loop is
the number of streams in it and the stream frequency is the number of times a
stream is in a loop.
Thus stream 1 & 3 are contained in stream 2, streams 5, 6 & 8 are contained in
stream 7 and 1, 5, & 6 are contained in stream 4. Since no more recycle loops
could be cut by any stream than by the stream which contains it, streams 1, 3, 5, 6,
and 8 cab be eliminated
Since a loop of rank 1 can only be cut by cutting the one remaining stream, streams
2 & 7 must be cut. Fortunately this breaks loop 3 & 4 at the same time. Therefore,
assuming values for the variables of streams 2 & 7 will allow a direct calculations
of all the unit of same fig. in the sequence (1, 4, 3, 5,2)
The adjacency matrix is another tool for separating serial and recycle sets of units.
The information flow diagram for fig. 3.2 is used as the example for the
development of adjacency matrix and its adjancency is given in table 3.5:
To unit
1 2 4 5 6 8 9 10 11
1 1
2 1
4 1
5 1 1
From unit
6 1
8 1
9 1 1
10 1 1
11
By definition there is unity in row i, column j of A (i.e. element aij=0. Suppose the
column corresponding to a unit in A has only zeros as for unit 1 of aboce table this
means that no unit is connected to unit 1 or in other words only feed stream enter
unit 1 can be recorded in a list for later calculation and removed from A by striking
out its column and its row then the reduced A becomes:
Table 3.6: Adjacency Matrix after deleting Rows & Columns
2 4 5 6 8 9 10 11
2 1
4 1
5 1 1
6 1
8 1
9 1 1
10 1 1
11
Once unit 1 is removed now unit 2 has a zero column and can thus be removed in a
similar way. there are no more zero columns.
Suppose the row corresponding to a unit has only zeros as does unit 11of the above
table this means that nit 11 is not connected to any other unit and will be directly
calculable . once all other units have been calculated then unit 11 may be recorded
in list for later calculation in front of the previous found unit with a zero row. and
so matrix A has been reduced to matrix A where all the remaining units 4, 5, 6, 8, 9
and 10 are either in recycle sets or in a serial set between a pair of recycle sets.
Table 3.7: Final Adjacency Matrix after deleting Rows & Columns
4 5 6 8 9 10
4 1
5 1 1
6 1
8 1
9 1 1
10 1
The same separation of initial and final serial seta has been achieved both by the
process matrix and by adjacency matrix. The further unsaveling of the remaining
units into distinct recycle sets can be done directly by use of the adjacency matrix
but only by exhaustive search using the process matrix
The reduced adjacency matrix A can be used to identify the different recycle sets
and if desired the recycle loops within each set. If the recycle set is to be solved by
treating all the units of the set simultaneously then it may not be necessary to
identify recycle loops within the set. If the set is to be solved by sequential
calculation of the units then the recycle loops may need to be identified.
The method of finding recycle sets and their loops requires finding the powers of
the adjacency matrix by matrix multiplication. The useful applies namely that the
element of the product of two matrix A and B is
ℎ , ℎ (, ) .
Boolean addition:
0 +0 = 0
0+1 = 1
1+1=1
Boolean multiplication:
0 .0=0
0 .1=0
1 .1=1
4 5 6 8 9 10
4 1
5 1 1
A= 6 1
8 1
9 1 1
10 1
4 5 6 8 9 10
4 1 1
A2 5 1 1
6 1
= 8 1 1
9 1
10 1 1
A3= 4 5 6 8 9 10
4 1 1
5 1 1 1
6 1 1
8 1
9 1 1
10 1
Identifying recycle sets : the reachability matrix:
If the Boolean sum of the powers of A is formed an element of units results
wherever units exists in any power. The resulting matrix is
records the connections from i to unit j via some numbers of streams <n as shown
in following table
R1 1
1 1
1
1
1
1
1
R2 1 1 1
1 1 1 1
1 1
1 1 1
1 1 1
1 1 1
R3 1 1 1 1
1 1 1 1 1
1 1 1
1 1 1
1 1 1
1 1 1
R∞ 1 1 1 1 1 1
1 1 1 1 1 1
1 1 1
1 1 1
1 1 1
1 1 1
Then element rij in matrix Rn equals 1 if and only if atleast one such connection
exists. In the limit as n tends to infinity
The reachability matrix records whether any connection exists from unit i to unit j
via any number streams. Thus
=1
≡ ∞, ∞
=1
= =1
only if j to i in the flow diagram. Then
≡ ∞, ∞=
R∞ 1 1
1 1
1 1 1
1 1 1
1 1 1
serial set : 6
This will eliminate any unit which is not in some recycle set because then there
will not be a connection from that unit to any other in both directions. But by the
definition of a recycle set all members are mutually connected. Thus any nonzero
row of matrix reveal a further recycle set and not an inlet or outlet unit is then a
serial set between a pair of recycle set and will be directly calculable when the
preceding recycle set has been calculated.