Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
A recursive synthesis method for heat exchanger networks. I. The algorithm
Autore:
Ren, Y; ONeill, BK; Roach, JR;
Indirizzi:
Univ Adelaide, Dept Chem Engn, Adelaide, SA 5005, Australia Univ AdelaideAdelaide SA Australia 5005 gn, Adelaide, SA 5005, Australia
Titolo Testata:
INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH
fascicolo: 4, volume: 40, anno: 2001,
pagine: 1168 - 1175
SICI:
0888-5885(20010221)40:4<1168:ARSMFH>2.0.ZU;2-S
Fonte:
ISI
Lingua:
ENG
Soggetto:
SIMULTANEOUS-OPTIMIZATION MODELS; PRELIMINARY SCREENING-PROCEDURE; MINLP SYNTHESIS; PROCESS SYSTEMS; MINIMUM NUMBER; INTEGRATION; DESIGN; ENERGY; UNITS; AREA;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
14
Recensione:
Indirizzi per estratti:
Indirizzo: O'Neill, BK Univ Adelaide, Dept Chem Engn, Adelaide, SA 5005, Australia Univ Adelaide Adelaide SA Australia 5005 , SA 5005, Australia
Citazione:
Y. Ren et al., "A recursive synthesis method for heat exchanger networks. I. The algorithm", IND ENG RES, 40(4), 2001, pp. 1168-1175

Abstract

This paper presents a recursive method for heat exchanger network synthesis based on a tree-decomposition strategy and a new match-selection model. The problem is decomposed as a binary tree, and each node is then categorized as either a capital-dominant or an energy-dominant problem. Subsequent decomposition of each node is determined by this dominance. The final design is obtained recursively by applying a design algorithm from child nodes to their parent node. The match-selection procedure is a hybrid method that exhibits some of the features of both evolutionary and mathematical programming methods, Matches are first allocated using a IP assignment model. This step is then followed by an evolutionary procedure in which the remaining sections of the design are treated as a new problem. The process is repeated until no saving can be discovered. The method avoids the solution of complex MINLP models, and consequently, it can be applied to solve large problems. Furthermore, it readily copes with typical constraints, such as forbiddenmatches and imposed matches. As a consequence, safety and layout considerations are easily incorporated into the design.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 13/08/20 alle ore 14:30:49