Heat Exchanger Network Synthesis With Detailed Exchanger Designs ‐ 2. Hybrid Optimization Strategy for Synthesis of Heat Exchanger Networks with Detailed Individual Heat Exchanger Designs

We propose a new strategy to synthesize heat exchanger networks with detailed designs of individual heat exchangers. The proposed strategy uses a multistep approach by first obtaining a heat exchanger network topology through solving a modified version of the mixed integer nonlinear programming (MINLP) stage‐wise superstructure of Yee and Grossmann, which includes a smoothed LMTD approximation and pressure drops. In a second nonlinear programming (NLP) suboptimization step, we allow for nonisothermal mixing to solve problems with or without exchanger bypasses. The selected heat exchangers along with the mass and energy balances obtained are then used to design the network with detailed exchanger designs through solving a sequence of NLPs for individual heat exchanger designs. The NLPs are based on the detailed discretized optimization models of Kazi et al., which solve quickly and reliably to obtain heat exchangers based on rigorous, first‐principles derived coupled differential equations. These models solve a differential algebraic equation system and do not rely on usual assumptions associated with other heuristic‐based exchanger design methods, such as log mean temperature difference and FT correction factors. These detailed exchanger designs are then used to update the network optimization model through sets of correction factors on heat exchanger area, number of shells, heat transfer coefficients, and pressure drops of each exchanger design, in a method based on that of Short et al. The method solves reliably, guaranteeing feasible exchangers for every potential network generated by the shortcut models, through validation with rigorous heat exchanger models at every iteration. In addition, the method does not increase the nonlinearity of the MINLP model, nor does it require any manual intervention or initialization from the user. Three examples are solved and the results are compared to those obtained in the literature.