【摘要】 本文给出了列队竞争算法解组合优化问题的框架和确定变异领域的两条原则 .对管路网络综合问题和换热网络综合问题确定了相应的变异领域 ,用列队竞争算法分别解这两个网络综合问题 ,所得到的最优解优于文献报道的结果 .更多还原

【Abstract】 Many synthesis problems of chemical processes are attributed to combinatorial optimization problems which are diffcult to solve. Line-up Competition Algorithm (LCA) presented in part Ⅰ is applied to the structural and parameter optimization for process synthesis in this paper. The expression of competition driving force and the algorithmic framework are given for solving combinatorial optimization problems. The wto principles of determining mutation adjacent regions are proposed which are helpful to balance local search and global search. The algorithm is applied to the optimization of a large scale pressure relief header network and a heat exchanger network synthesis problem,respectively, and the results show that LCA algorithm can discover a very good near-optimum solution after examining an extremely small fraction of possible solutions. The solution is superior to those obtained with simulated annealing algorithms and genetic algorithms in literature. Examples demonstrate that LCA algorithm has great potential for solving combinatorial optimization problems.更多还原