换热网络综合问题是带约束条件的非凸问题,存在多个极值,在优化的过程中经典优化算法很容易陷入局部极小值点。本文结合填充函数法和打洞函数法的优点,构造一个新的跨越局部极值的函数应用于换热网络优化问题中,在搜寻最佳物流匹配和换热面积的过程中,跳出次优的换热网络结构,寻找更优的网络结构,直至最优网络结构。实例表明,该方法能够找到比文献更好的换热网络结构。
The synthesis problem of heat exchanger networks is a non-convex problem with constrict conditions,it has lots of extremums.During optimization by using classical optimization algorithm, it's easy to get local minimums.A new jump-out-of-minimums function which combined the advantages of Filling and tunneling function is constructed in this paper and it can be applied to optimize heat exchanger networks.In the process of searching the optimal match between flows and heat change area,the sub-optimal structure will be jumped out automatically so that we can get a better one.It won't stop until the best optimization match is searched.The results have shown this new method can get better structure than the other literatures.