Shell and tube heat exchanger design using mixed-integer linear programming

被引:25
|
作者
Goncalves, Caroline de O. [1 ]
Costa, Andre L. H. [1 ]
Bagajewicz, Miguel J. [2 ]
机构
[1] Rio de Janeiro State Univ UERJ, Inst Chem, Rua Sao Francisco Xavier 524, BR-20550900 Rio De Janeiro, RJ, Brazil
[2] Univ Oklahoma, Sch Chem Biol & Mat Engn, Norman, OK 73019 USA
关键词
optimization; design; POINT-OF-VIEW; GENETIC ALGORITHMS; OPTIMIZATION; MODEL; COST;
D O I
10.1002/aic.15556
中图分类号
TQ [化学工业];
学科分类号
0817 ;
摘要
The design of heat exchangers, especially shell and tube heat exchangers was originally proposed as a trial and error procedure where guesses of the heat transfer coefficient were made and then verified after the design was finished. This traditional approach is highly dependent of the experience of a skilled engineer and it usually results in oversizing. Later, optimization techniques were proposed for the automatic generation of the best design alternative. Among these methods, there are heuristic and stochastic approaches as well as mathematical programming. In all cases, the models are mixed integer non-linear and non-convex. In the case of mathematical programming solution procedures, all the solution approaches were likely to be trapped in a local optimum solution, unless global optimization is used. In addition, it is very well-known that local solvers need good initial values or sometimes they do not even find a feasible solution. In this article, we propose to use a robust mixed integer global optimization procedure to obtain the optimal design. Our model is linear thanks to the use of standardized and discrete geometric values of the heat exchanger main mechanical components and a reformulation of integer nonlinear expressions without losing any rigor. (c) 2016 American Institute of Chemical Engineers AIChE J, 63: 1907-1922, 2017
引用
收藏
页码:1907 / 1922
页数:16
相关论文
共 50 条
  • [41] Task Scheduling for Multiunit Parallel Test Using Mixed-Integer Linear Programming
    Yang, Zhao
    Xiao, Han-Shan
    Guan, Rui
    Yang, Yang
    Ji, Hong-Liang
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2021, 2021
  • [42] Environmental-economic unit commitment using mixed-integer linear programming
    Xie, J.
    Zhong, J.
    Li, Z.
    Gan, D.
    EUROPEAN TRANSACTIONS ON ELECTRICAL POWER, 2011, 21 (01): : 772 - 786
  • [43] Optimal energy management in public buildings using mixed-integer linear programming
    Vujkov, Barbara
    Dumnic, Boris
    Popadic, Bane
    Grbic, Tatjana
    Milicevic, Dragan
    PROCEEDINGS OF 2020 INTERNATIONAL CONFERENCE ON SMART SYSTEMS AND TECHNOLOGIES (SST 2020), 2020, : 225 - 228
  • [44] Optimal phase balancing in distribution system using mixed-integer linear programming
    Khodr, H. M.
    Zerpa, I. J.
    De Oliveira-De Jesus, P. M.
    Matos, Manuel A.
    2006 IEEE/PES TRANSMISSION & DISTRIBUTION CONFERENCE & EXPOSITION: LATIN AMERICA, VOLS 1-3, 2006, : 595 - +
  • [45] A Mixed-Integer Programming Approach for the Design of Homogeneous Magnets
    Chan, T.
    Dayarian, I.
    Jaffray, D.
    Stanescu, T.
    MEDICAL PHYSICS, 2017, 44 (06) : 3156 - 3156
  • [46] EXPERIMENTS IN MIXED-INTEGER LINEAR-PROGRAMMING USING PSEUDO-COSTS
    GAUTHIER, JM
    RIBIERE, G
    MATHEMATICAL PROGRAMMING, 1977, 12 (01) : 26 - 47
  • [47] Piecewise Linear Function Fitting via Mixed-Integer Linear Programming
    Rebennack, Steffen
    Krasko, Vitally
    INFORMS JOURNAL ON COMPUTING, 2020, 32 (02) : 507 - 530
  • [48] Trajectory planning of multiple autonomous systems using mixed-integer linear programming
    Ademoye, Taoridi A.
    Davari, Asad
    Proceedings of the Thirty-Eighth Southeastern Symposium on System Theory, 2004, : 260 - 264
  • [49] Mixed-integer programming for control
    Richards, A
    How, J
    ACC: PROCEEDINGS OF THE 2005 AMERICAN CONTROL CONFERENCE, VOLS 1-7, 2005, : 2676 - 2683
  • [50] Mixed-time mixed-integer linear programming scheduling model
    Westerlund, Joakim
    Hastbacka, Mattias
    Forssell, Sebastian
    Westerlund, Tapio
    INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 2007, 46 (09) : 2781 - 2796