This characteristic can be successfully used to solve 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 -完全的组合优化问题，至今尚无很好的解析算法，一般采用启发式算法来解决。
应用推荐