首页 | 本学科首页   官方微博 | 高级检索  
     

匈牙利法解换热网络时退化现象的处理
引用本文:徐亦方,谭庆. 匈牙利法解换热网络时退化现象的处理[J]. 中国石油大学学报(自然科学版), 1990, 0(1)
作者姓名:徐亦方  谭庆
作者单位:石油大学 北京(徐亦方),石油大学 北京(谭庆)
摘    要:实现匈牙利法的常用算法有Gillett法和Kuhn法,目前用于换热网络综合,但在实际应用中有时失败。本文分析失败的原因在于发生了退化现象。依据Konig定理提出禁点的概念,并且证明若选禁点为节点(即匹配),则必不能得出最多节点(即最大匹配),并导致失败。禁点是覆盖全部零元素最少直线的交叉点零元素。文章还提出了新的算法。

关 键 词:换热网络  匈牙利法  最大匹配  过程综合  退化

THE TREATMENT OF DEGENERACY IN HEAT EXCHANGER NETWORK SYNTHESIS WITH HUNGARIAN ALGORITHM
Xu Yijnng Tan Qing University of Petroleum. THE TREATMENT OF DEGENERACY IN HEAT EXCHANGER NETWORK SYNTHESIS WITH HUNGARIAN ALGORITHM[J]. Journal of China University of Petroleum (Edition of Natural Sciences), 1990, 0(1)
Authors:Xu Yijnng Tan Qing University of Petroleum
Abstract:The degeneracy of heat exchanger network synthesis with Hungarian Algorithm by Gillett method or Kuhnmethod often causes the failure of these methods. From Konig theorem, the authors defined forbidden points, which are zero elements at the cross points of minimum lines covering all zero elements in the efficiency matrix. It was proved that any selection of the forbidden points as matches would make the matches less than maximum matching. This is the cause of failure of the above methods, A new algorithm based on the theorem was presented to deal with the degeneracy.
Keywords:Heat exchanger network  Hungarian algorithm  Maximum matching  Process synthesis  Degeneracy
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号