在此基础上，提出了列队竞争算法解网络综合问题的计算方法。
The computational method of solving heat exchanger network by using line up competition algorithm is proposed.
给出了列队竞争算法解组合优化问题的框架和确定变异邻域的两条原则。
The framework is given for solving combinatorial optimization problems with Line up Competition Algorithm (LCA), and the two principles of determining mutation neighbor region is presented.
用列队竞争算法解旅行商问题获得了满意的结果，显示出列队竞争算法良好的全局搜索性能。
By using LCA to solve traveling salesman problem, satisfactory results are obtained. Examples show that LCA has good global search characteristic.
应用推荐