Approximation algorithms for the minimum number of matches problem in heat exchanger network synthesis

被引:15
|
作者
Furman, KC [1 ]
Sahinidis, NV [1 ]
机构
[1] Univ Illinois, Dept Chem & Biomol Engn, Urbana, IL 61801 USA
关键词
D O I
10.1021/ie049978l
中图分类号
TQ [化学工业];
学科分类号
0817 ;
摘要
Although the use of heuristics has been prevalent in the process synthesis literature, their justification has been exclusively based on empirical evidence obtained through computational testing. As a result, heuristics currently in use offer no guarantee of optimality. Optimization algorithms, on the other hand, offer rigor but suffer from the combinatorial explosion of computational requirements necessary to produce an optimal solution. Recognizing this gap between heuristic and optimization approaches in process synthesis, we propose the use of analytical techniques in the development and assessment of heuristics. The primary purpose of this paper is to introduce the analysis of algorithm performance into the field of process synthesis and develop the first approximation algorithms for process synthesis. Approximation algorithms are heuristics with guaranteed performance. In the context of the classical matches problem in heat exchanger network synthesis, we develop approximation algorithms based on primal rounding, dual rounding, Lagrangean relaxation rounding, primal-dual approximation, and greedy approximation. We provide an analytical characterization of the worst-case behavior of these as well as any heuristic that may be devised for the matches problem. In computational experiments with a test set of 29 problems from the literature, we find that the developed suite of algorithms performs much better than its theoretical worst-case bound and provides solutions that average within 25% of optimality. On the other hand, five of these test problems are beyond the capabilities of current state-of-the-art optimization software. Finally, we pose a number of interesting research challenges in this area.
引用
收藏
页码:3554 / 3565
页数:12
相关论文
共 50 条
  • [21] Approximation Algorithms for the Minimum Power Partial Cover Problem
    Li, Menghong
    Ran, Yingli
    Zhang, Zhao
    [J]. ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, AAIM 2019, 2019, 11640 : 179 - 191
  • [22] New approximation algorithms for the minimum cycle cover problem
    Yu, Wei
    Liu, Zhaohui
    Bao, Xiaoguang
    [J]. THEORETICAL COMPUTER SCIENCE, 2019, 793 : 44 - 58
  • [23] New Approximation Algorithms for the Minimum Cycle Cover Problem
    Yu, Wei
    Liu, Zhaohui
    Bao, Xiaoguang
    [J]. FRONTIERS IN ALGORITHMICS (FAW 2018), 2018, 10823 : 81 - 95
  • [24] An improved algorithm for synthesis of heat exchanger network with a large number of uncertain parameters
    Zirngast, Klavdija
    Kravanja, Zdravko
    Novak Pintarič, Zorka
    [J]. Energy, 2021, 233
  • [25] An improved algorithm for synthesis of heat exchanger network with a large number of uncertain parameters
    Zirngast, Klavdija
    Kravanja, Zdravko
    Pintaric, Zorka Novak
    [J]. ENERGY, 2021, 233
  • [26] Interfacing heat exchanger network synthesis and detailed heat exchanger design
    Polley, G.T.
    Shahi, M.H.Panjeh
    [J]. Chemical Engineering Research and Design, 1991, 69 (06) : 445 - 457
  • [27] Minimum units targeting and network evolution for batch heat exchanger network
    Foo, Dominic Chwan Yee
    Chew, Yin Hoon
    Lee, Chew Tin
    [J]. APPLIED THERMAL ENGINEERING, 2008, 28 (16) : 2089 - 2099
  • [28] ON THE APPROXIMATION PROBLEM IN NETWORK SYNTHESIS
    BRESLER, AD
    [J]. PROCEEDINGS OF THE INSTITUTE OF RADIO ENGINEERS, 1952, 40 (12): : 1724 - 1728
  • [29] SYNTHESIS OF A HEAT-EXCHANGER NETWORK
    BELKEBIR, M
    GUIGLION, C
    DOMENECH, S
    PIBOULEAU, L
    [J]. CHEMICAL ENGINEERING JOURNAL AND THE BIOCHEMICAL ENGINEERING JOURNAL, 1989, 42 (02): : 119 - 133
  • [30] Approximation Algorithms for a Capacitated Network Design Problem
    Refael Hassin
    R. Ravi
    F. Sibel Salman
    [J]. Algorithmica , 2004, 38 : 417 - 431