论文部分内容阅读
分离网络综合问题因其巨大的搜索空间导致优化计算的高复杂性。为提高分离网络综合问题的求解效率,该文提出了基矩阵和基矩阵集合的概念,建立了分离网络优化模型。列队竞争算法因其具有快速搜索到全局最优解或近似全局最优解的优点,而被用来求解该分离网络优化模型。用该文提出的方法对两个较大规模的分离网络综合问题进行了求解。计算结果证明:该方法能有效减少变量数,提高全局最优解的搜索效率。
Separating the network synthesis problem because of its huge search space led to the high complexity of optimization calculation. In order to improve the efficiency of the separation network synthesis, this paper proposes the concept of the basis matrix and the matrix set, and establishes a separation network optimization model. The queuing competition algorithm is used to solve this separation network optimization model because of its advantages of fast searching for global optimal solutions or approximate global optimal solutions. The method proposed in this paper is used to solve the two large-scale separation network synthesis problems. The calculation results show that this method can effectively reduce the number of variables and improve the search efficiency of the global optimal solution.