在此基础上，提出了列队竞争算法解网络综合问题的计算方法。
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.
统计计算结果表明，列队竞争算法对求解大规模的全局优化问题具有较好的稳健性和搜索效率。
LCA was applied to solve a larger scale location-allocation problem, and the solutions obtained were superior to those obtained by a hybrid algorithm of coupling…
基于此超结构，建立了全局能量集成的混合整数非线性规划模型，并用列队竞争算法进行求解。
Based on the super structure, a mixed integer non-linear programming (MINLP) model is established for total site energy integration.
实例计算结果表明列队竞争算法是求解非凸非线性规划问题和混合整数非线性规划问题的一种非常有效的算法。
Computational results indicate that LCA is a very effective algorithm to solve nonlinear programming problems and mixed-integer nonlinear programming problems.
实例计算结果表明列队竞争算法是求解非凸非线性规划问题和混合整数非线性规划问题的一种非常有效的算法。
Computational results indicate that LCA is a very effective algorithm to solve nonlinear programming problems and mixed-integer nonlinear programming problems.
应用推荐