Improved heuristic algorithm for selection of tear streams and precedence ordering in process flowsheeting computations
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 algo...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Norwegian Society of Automatic Control
1990-01-01
|
Series: | Modeling, Identification and Control |
Subjects: | |
Online Access: | http://www.mic-journal.no/PDF/1990/MIC-1990-1-2.pdf |
id |
doaj-2d485d99ab9f4b2096ec51add01d1bc1 |
---|---|
record_format |
Article |
spelling |
doaj-2d485d99ab9f4b2096ec51add01d1bc12020-11-24T23:25:36ZengNorwegian Society of Automatic ControlModeling, Identification and Control0332-73531890-13281990-01-01111134110.4173/mic.1990.1.2Improved heuristic algorithm for selection of tear streams and precedence ordering in process flowsheeting computationsKristian M. LienTerje HertzbergThis 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. http://www.mic-journal.no/PDF/1990/MIC-1990-1-2.pdfTearingdecompositionprecedence ordering |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Kristian M. Lien Terje Hertzberg |
spellingShingle |
Kristian M. Lien Terje Hertzberg Improved heuristic algorithm for selection of tear streams and precedence ordering in process flowsheeting computations Modeling, Identification and Control Tearing decomposition precedence ordering |
author_facet |
Kristian M. Lien Terje Hertzberg |
author_sort |
Kristian M. Lien |
title |
Improved heuristic algorithm for selection of tear streams and precedence ordering in process flowsheeting computations |
title_short |
Improved heuristic algorithm for selection of tear streams and precedence ordering in process flowsheeting computations |
title_full |
Improved heuristic algorithm for selection of tear streams and precedence ordering in process flowsheeting computations |
title_fullStr |
Improved heuristic algorithm for selection of tear streams and precedence ordering in process flowsheeting computations |
title_full_unstemmed |
Improved heuristic algorithm for selection of tear streams and precedence ordering in process flowsheeting computations |
title_sort |
improved heuristic algorithm for selection of tear streams and precedence ordering in process flowsheeting computations |
publisher |
Norwegian Society of Automatic Control |
series |
Modeling, Identification and Control |
issn |
0332-7353 1890-1328 |
publishDate |
1990-01-01 |
description |
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. |
topic |
Tearing decomposition precedence ordering |
url |
http://www.mic-journal.no/PDF/1990/MIC-1990-1-2.pdf |
work_keys_str_mv |
AT kristianmlien improvedheuristicalgorithmforselectionoftearstreamsandprecedenceorderinginprocessflowsheetingcomputations AT terjehertzberg improvedheuristicalgorithmforselectionoftearstreamsandprecedenceorderinginprocessflowsheetingcomputations |
_version_ |
1725556619169759232 |