This characteristic can be successfully used to solve combination optimization problems.
这一特性可成功地应用于解决组合优化问题。
Its successful application in combination optimization problems makes our focus on its application in continuous optimization problems.
蚁群算法在组合优化问题的成功应用，使得人们开始将焦点又集中在其在连续优化问题上的应用。
A new sequential uncertainty domain method called SUACO is presented on the basis of ant colony optimization, which is adapted to solve complex combination optimization problems.
本文在介绍求解复杂组合优化问题而提出的蚁群算法的基础上，提出一种基于连续不确定区域的蚁群算法。
Particle swarm optimization is widely used to solve continuous function optimization issue, but its application in discrete combination optimization problems is still relatively few.
粒子群算法在求解连续函数优化问题中取得了广泛的应用，但是其在离散的组合优化问题中的运用还比较少。
For NP-complete combination optimization problems, there is no efficient algorithm to the solution of the problems. Consequently, heuristic algorithms may be used to solve such type of problems.
对于NP -完全的组合优化问题，至今尚无很好的解析算法，一般采用启发式算法来解决。
Based on the theory of solving optimization combination problems by using neural networks, the computational energy functions are united with the penalty functions.
基于神经网络解决优化组合问题原理，将计算能量函数与罚函数有机地进行了统一。
Evolutionary algorithm is applied to solve distillation separation sequence optimization synthesis problems that are characteristic of combination explosion.
采用演化算法求解具有组合爆炸特征的精馏分离序列优化综合问题。
Modern enterprise reorganization and CIMS resource scheduling are typical optimization problems of resource combination.
现代企业重组及CIMS资源调度问题是一类典型资源组合优化问题。
Problems on existing network are analyzed in combination with author's planning experience, Suggestions on local transmission network optimization is delivered.
根据长期工作经验，对现有网络存在的问题进行分析，提出对本地传输网网络优化的有关建议。
Just as this paper points out, most problems about combination and sequential optimization are in fact NP-complete, so, it's impossible to find a general algorithm to solve all the problem presently.
正如文中所指出的那样，绝大多数组合与时序优化问题，实际上都是NP -完全问题，因而试图给出现实可行的一劳永逸的通用算法在目前是办不到的。
Just as this paper points out, most problems about combination and sequential optimization are in fact NP-complete, so, it's impossible to find a general algorithm to solve all the problem presently.
正如文中所指出的那样，绝大多数组合与时序优化问题，实际上都是NP -完全问题，因而试图给出现实可行的一劳永逸的通用算法在目前是办不到的。
应用推荐