“Improved heuristic algorithm for selection of tear streams and precedence ordering in process flowsheeting computations”

Authors: Kristian M. Lien and Terje Hertzberg,
Affiliation: SINTEF
Reference: 1990, Vol 11, No 1, pp. 13-41.

Keywords: Tearing, decomposition, precedence ordering, process flowsheeting

Abstract: This paper presents a new algorithm based on the heuristic tearing algorithm by Gundersen and Hertzberg (1983). The basic idea in both the original and the proposed algorithm is sequential tearing of strong components which have been identified by an algorithm proposed by Targan (1972). The new algorithm has two alternative options for selection of tear streams, and alternative precedence orderings may be generated for the selected set of tear streams. The algorithm has been tested on several problems. It has identified minimal (optimal) tear sets for all of them, including the four problems presented in Gundersen and Hertzberg (1983) where the original algorithm could not find a minimal tear set. A Lisp implementation of the algorithm is described, and example problems arc presented.

PDF PDF (2576 Kb)        DOI: 10.4173/mic.1990.1.2

DOI forward links to this article:
[1] S. LAKSHMINARAYANAN, S. SUBBA RAO and CH. DURGAPRASADA RAO (1992), doi:10.1080/00986449208936028
[2] J. R. ROACH, B. K. O'NEILL and D. A. HOCKING (1997), doi:10.1080/00986449708936616
[1] ASPEN TECHNOLOGY (1986). ASPEN PLUS Introductory Manual, Cambridge, Massachusetts.
[2] BARKLEY, R.W., MOTARD, R.L. (1972). Decomposition of Nets, Chem. Eng. J., 3, 265 doi:10.1016/0300-9467(72)85030-5
[3] CHRISTENSEN, J.H., RUDD, D.F. (1969). AIChE J, 15, 94.
[4] GOLD HILL COMPUTERS (1985). Golden Common Lisp, Cambridge, Massachusetts.
[5] GUNDERSEN, T. (1982). Decomposition of Large Scale Chemical Engineering Systems, Ph.D. thesis, The Norwegian Institute of Technology, Trondheim, Norway.
[6] GUNDERSEN, T., HERTZBERG, T. (1983). Partitioning and Tearing of Networks Applied to Process Flowsheeting, Modeling, Identification and Control, 4, 139 doi:10.4173/mic.1983.3.2
[7] KARP, R.M. (1972). Complexity of Computer Computations, Plenum Press, New York, p. 85.
[8] PHO, K., LAPIDUS, L. (1973). Topics in computer-aided design - Part I: An optimum tearing algorithm for recycle systems, AIChE J., 19, 1170 doi:10.1002/aic.690190614
[9] SIMULATION SCIENCES, INC. (1982). PROCESS Reference Manual, Fullerton, California.
[10] STEELE, G.L. (1984). Common Lisp, Digital Press. Billerica, Massachusetts.
[11] TARJAN, R. (1972). SIAM J Comp, 1, 146;.1973. Ibid., 2, 211.
[12] WESTERBERG, A.W., HUTCHISON, H.P., MOTARD, R.L., WINTER, P. (1979). Process Flowsheeting, Cambridge University Press.

  title={{Improved heuristic algorithm for selection of tear streams and precedence ordering in process flowsheeting computations}},
  author={Lien, Kristian M. and Hertzberg, Terje},
  journal={Modeling, Identification and Control},
  publisher={Norwegian Society of Automatic Control}