Computational strategies for large-scale MILP transshipment models for heat exchanger network synthesis. (2nd November 2015)

• Record Type: Journal Article
• Authors: Chen, Yang; Grossmann, Ignacio E.; Miller, David C.
• Is Part Of: Computers & chemical engineering. Volume 82(2015)
• Page Start: 68
• Page End: 83
• Publication Date: 2015-11-02
• Subjects: Heat exchanger network synthesis (HENS) -- Transshipment model -- Mixed-integer linear programming -- Computational strategies -- Model reformulation; Chemical engineering -- Data processing -- Periodicals; 660.0285
• DOI: 10.1016/j.compchemeng.2015.05.015
• Languages: English
• ISSNs: 0098-1354

Abstract

Highlights: Model reformulations are proposed for finding the exact optimal solution. Several solution strategies are developed for finding the exact optimal solution. Several approximation approaches are developed for finding near optimal solutions. Some large-scale MILP transshipment models are solved in reasonable times. Abstract: Determining the minimum number of units is an important step in heat exchanger network synthesis (HENS). The MILP transshipment model (Papoulias and Grossmann, 1983 ) and transportation model (Cerda and Westerberg, 1983 ) were developed for this purpose. However, they are computationally expensive when solving for large-scale problems. Several approaches are studied in this paper to enable the fast solution of large-scale MILP transshipment models. Model reformulation techniques are developed for tighter formulations with reduced LP relaxation gaps. Solution strategies are also proposed for improving the efficiency of the branch and bound method. Both approaches aim at finding the exact global optimal solution with reduced solution times. Several approximation approaches are also developed for finding good approximate solutions in relatively short times. Case study results show that the MILP transshipment model can be solved for relatively large-scale problems in reasonable times by applying the approaches proposed in this paper.