用列队竞争算法来解分离序列综合问题

提出了一种分离序列超结构的简洁表达方式，对N个组分的混合物分离问题，仅需N-1个整数即可表示所有的分离序列。基于所提出的超结构表达方式，确定了产生相邻分离序列的策略。在此基础上用作者提出的列队竞争算法对较大规模的分离序列综合问题进行了计算，结果表明用列队竞争算法只需搜索极少的解空间就能找到最优或接近最优的分离序列。

Solving Separation Sequence Synthesis Problem with Line-up Competition Algorithm

A concise expression of separation sequence superstructure is proposed, where N-1 integerscan be used to represent all possible separation sequence for N component mixtllre. Based on theproposed superstructure expression, the strategy of producing adjacent separation sequence isdetermined. Larger scale separation sequence synthesis problems were computed by using Line-upCompetition Algorithm (LCA) presented by author. Results show that LCA can find optimal or nearoptimal separation sequence by searching less solution space.