Abstract

In this paper, a mixed integer nonlinear programming (MINLP) model is presented which can generate networks where utility cost, exchanger areas and selection of matches are optimized simultaneously. The proposed model does not rely on the assumption of fixed temperature approaches (HRAT or EMAT), nor on the prediction of the pinch point for the partitioning into subnetworks. The model is based on the stage-wise representation introduced in Part I of this series of papers, where within each stage, potential exchanges between each hot and cold stream can occur. The simplifying assumption on isothermal mixing to calculate heat transfer area for stream splits allows the feasible space to be defined by a set of linear constraints. As a result, the model is robust and can be solved with relative ease. Constraints on the network design that simplify its structure, e.g. no stream splits, forbidden matches, required and restricted matches as well as the handling of multiple utilities can be easily included in the model. In addition, the model can consider matches between pairs of hot streams or pairs of cold streams, as well as variable inlet and outlet temperatures. Several examples are presented to illustrate the capabilities of the proposed simultaneous synthesis model. The results show that in many cases, heuristic rules such as subnetwork partitioning, no placement of exchangers across the pinch, number of units, fail to hold when the optimization is performed simultaneously.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.