𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Simultaneous synthesis of distillation trains and heat exchanger networks

✍ Scribed by Miguel A. Isla; Jaime Cerdá


Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
983 KB
Volume
42
Category
Article
ISSN
0009-2509

No coin nor oath required. For personal study only.

✦ Synopsis


A new mathematical formulation for the optimal synthesis of heat-integrated distillation systems that accounts for constrained heat matches between columns and the rest of the process is presented. The definition of temperature intervals commonly used by heat exchanger network synthesis procedures is embedded in the proposed formulation that can be regarded as a generalization of the network flow model of Cerd& and Westerberg (1983, Chem. Engng Sci. 38, 1723) under conditions of variable stream temperatures. The minimization of the total flow-sheet utility cost has been chosen as the design target. The problem has been represented through a mixed-integer linear program. By performing the search with a standard branch-and-bound technique the global optimality of the solution found is guaranteed. Three case studies involving the separation ofa ternary mixture by distillation have been solved. The consideration of the rest of the process produces in two of them new distillation train designs costing less overall.


📜 SIMILAR VOLUMES


Synthesis of heat exchange networks by m
✍ R. C. Kelahan; J. L. Gaddy 📂 Article 📅 1977 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 711 KB

## Abstract Process synthesis involves manipulation of the process arrangement, while studying the variables of each arrangement, to arrive at the optimal process. If each process arrangement is treated as a discrete variable, process synthesis becomes a mixed integer optimization problem. This pap

Synthesis of heat exchange networks: A n
✍ Vincenzo Cena; Carlo Mustacchi; Fabrizio Natali 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 498 KB

The choice of the process streams to be contacted for heat recovery IS carrled out by structurmg the model mto one dlsplaymg the well-known pattern of the optimal assignment problem of Operations Research The solution yields a pseudo-flow diagram describing the mterconnectlons of a high number of el