Heuristics with performance guarantees for the minimum number of matches problem in heat recovery network design
Heuristics with performance guarantees for the minimum number of matches problem in heat recovery network design
复制标题
热回收网络设计中最小匹配数问题的性能保证启发法
DOI：
10.1016/j.compchemeng.2018.03.002
复制
发表时间：
2018
影响因子：
4.3
通讯作者：
Letsios D
中科院分区：
文献类型：
--
作者：
Letsios D
热交换器网络综合利用多余的热量，通过整合过程冷热流和提高能源效率，通过减少公用事业的使用。确定最小匹配数的可证明的好解是使用顺序方法设计热回收网络的瓶颈。该子问题是一个NP-hard混合整数线性规划，在可能的冷热流构型下表现出组合爆炸。我们从图论的角度探讨了这个具有挑战性的优化问题，并将其与其他特殊的优化问题（如成本流网络和包装问题）联系起来。在单一温度区间的情况下，我们开发了一个新的优化公式，没有大m参数的问题。我们开发了具有性能保证的启发式方法，使用三种方法：(i)松弛舍入，（ii）水填充和（iii）贪婪填充。51个实例的数值结果证实了方法的有效性。
Heat exchanger network synthesis exploits excess heat by integrating process hot and cold streams and improves energy efficiency by reducing utility usage. Determining provably good solutions to the minimum number of matches is a bottleneck of designing a heat recovery network using the sequential method. This subproblem is an NP-hard mixed-integer linear program exhibiting combinatorial explosion in the possible hot and cold stream configurations. We explore this challenging optimization problem from a graph theoretic perspective and correlate it with other special optimization problems such as cost flow network and packing problems. In the case of a single temperature interval, we develop a new optimization formulation without problematic big-M parameters. We develop heuristic methods with performance guarantees using three approaches:(i) relaxation rounding,(ii) water filling, and (iii) greedy packing. Numerical results from a collection of 51 instances substantiate the strength of the methods.