Please use this identifier to cite or link to this item:
|Title:||Efficient algorithm for simultaneous synthesis of heat exchanger networks|
Heat exchanger network synthesis (HENS)
Mixed-integer nonlinear programming (MINLP)
|Citation:||Huang, K.F., Karimi, I.A. (2014-02-24). Efficient algorithm for simultaneous synthesis of heat exchanger networks. Chemical Engineering Science 105 : 53-68. ScholarBank@NUS Repository. https://doi.org/10.1016/j.ces.2013.10.040|
|Abstract:||The mathematical programming based simultaneous approaches for heat exchanger network synthesis (HENS) result in large, complex, non-convex mixed-integer nonlinear programming (MINLP) models, for which finding even a feasible solution is a challenge. We propose a tailor-made search strategy that repeatedly revives the outer approximation (OA) algorithm of Viswanathan and Grossmann (1990), which in its original form is mostly ineffective for solving large HENS problems. We propose three smaller and simpler perturbations of the master problem in the OA algorithm by prioritizing, fixing, eliminating, or limiting exchangers in various ways to avoid premature termination. Our approach needs no feasible starting point, and solves much faster and better than some commercial MINLP solvers. We illustrate the application of our strategy with two recent HENS models on seven literature examples with up to 39 process streams. The algorithm solves them very efficiently and obtains solutions as good or better than those reported in the literature. Its robustness and effectiveness are exemplified by a large literature problem involving 39 process streams, where it obtains a 0.32% better solution than the best reported in the literature via a genetic algorithm. © 2013.|
|Source Title:||Chemical Engineering Science|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 18, 2018
WEB OF SCIENCETM
checked on Jun 5, 2018
checked on May 12, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.