基于基矩阵和基矩阵集合的分离网络优化模型  

Separation network optimization model with a base matrix and the base matrix set

作　　者：鄢烈祥[1] 邹强[1] 史彬[1] 陈国辉[1] 

机构地区：[1]武汉理工大学化学工程学院,武汉430070

出　　处：《清华大学学报（自然科学版）》2012年第3期303-307,313,共6页Journal of Tsinghua University(Science and Technology)

基　　金：国家自然科学基金项目(20976142)

摘　　要：分离网络综合问题因其巨大的搜索空间导致优化计算的高复杂性。为提高分离网络综合问题的求解效率,该文提出了基矩阵和基矩阵集合的概念,建立了分离网络优化模型。列队竞争算法因其具有快速搜索到全局最优解或近似全局最优解的优点,而被用来求解该分离网络优化模型。用该文提出的方法对两个较大规模的分离网络综合问题进行了求解。计算结果证明:该方法能有效减少变量数,提高全局最优解的搜索效率。Separation-network optimization is complex due to the huge search space for the optimization. This paper presents the concepts of the base matrix and the base matrix set with an optimal separation network model to improve the solution of separation-network synthesis problems. A line-up competition algorithm used to solve the optimal separation network model can quickly search for a globally or approximately globally optimal solution. Two large-scale separation-network synthesis problems are solved to show how the method effectively reduces the number of variables and improves the search efficiency for the globally optimal solution.

关 键 词：分离网络 基矩阵 列队竞争算法 优化 

分 类 号：TQ021.8[化学工程] TQ062.2