This characteristic can be successfully used to solve combination optimization problems.
这一特性可成功地应用于解决组合优化问题。
The introduction of simulating annealing algorithm solves the difficulty in combination optimization effectively.
引入模拟退火算法后，有效地解决了这一组合优化的难题。
PSO can solve a discrete combination optimization such as VRP by using random exchange sequence and PMX operator.
通过引入随机交换序、PMX算子使微粒群优化算法能够求解车辆路径问题这类离散组合优化问题。
A PSO can solve a discrete combination optimization such as VRP by using random exchange sequence and PMX operator.
通过引入随机交换序、PMX算子使微粒群优化算法能够求解车辆路径问题这类离散组合优化问题。
QoS multicast routing problem is a nonlinear combination optimization problem, which has been proved to be a NP complete problem.
组播路由问题是一个非线性的组合优化问题，已证明了该问题是NP完全问题。
The hot rolling lot planning in iron and steel enterprises is a large-scale combination optimization problem with many restrictions.
钢铁生产中热轧批量计划编制属于多约束情况下大规模组合优化问题。
Its successful application in combination optimization problems makes our focus on its application in continuous optimization problems.
蚁群算法在组合优化问题的成功应用，使得人们开始将焦点又集中在其在连续优化问题上的应用。
The Film Deliverer Problem(FDP), a new problem in the combination optimization is much more complicated than the Traveling Salesman Problem(TSP).
影片递送问题（简称FDP）是组合优化的一个新问题，它比旅行商问题（简称TSP）复杂得多。
The Film Deliverer problem (FDP), a new problem in the combination optimization is much more complicated than the Traveling Salesman problem (TSP).
影片递送问题(简称FDP)是组合优化的一个新问题，它比旅行商问题(简称TSP)复杂得多。
Vehicle Routing problem (VRP) is a combination optimization problem in transportation logistics, which has been applied in many fields. It is a strong NP problem.
车辆路径问题是一类在物流配送调度中具有广泛应用的组合优化问题，属于强np难题。
The actual calculation indicates that the gradual optimization not only has rapid calculation speed but also yields consistent results with the combination optimization.
实际运算表明，逐步优化不仅运算速度快，而且得到了与组合优化完全一致的结果。
Logistic vehicle routing problem is combination optimization that is difficult to solve. Due to its NP characteristics, we can't get satisfying results when we use exact approaches.
配送车辆优化调度问题是一类求解较难的组合优化问题，由于其NP难特性，采用精确优化方法有一定的局限性，不能得到令人满意的结果。
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 -完全的组合优化问题，至今尚无很好的解析算法，一般采用启发式算法来解决。
The job-shop scheduling research belongs to the combination optimization category, it is the typical NP difficult question, its research has great theory significance and practical significance.
车间作业调度研究属于组合优化范畴，是典型的NP难问题，对它的研究具有重大的理论意义和现实意义。
Timetabling Problem (TP) is a Multiobjective Combination Optimization Problem with constraints, and also has been proved NP-Completed.
排课问题是一个有约束的、多目标的组合优化问题，并且已经被证明为一个NP完全问题。
Both the applied analysis of combination-optimization theory and the match analysis of actual production data show that this method is helpful and has high prediction accuracy.
组合优化理论的应用分析和对实际生产数据的拟合分析均表明，该方法具有较好的预测能力和较高的预测精度。
The crew scheduling belongs to the typical combination-optimization problem and has some traits such as complexity, huge data, multi-aims and multi-restriction. It is usually solved by subsection.
机组编排属于典型的组合优化问题，具有情况复杂、数据量大、优化目标和限制条件多等特点，通常采用分段解决。
The crew scheduling belongs to the typical combination-optimization problem and has some traits such as complexity, huge data, multi-aims and multi-restriction. It is usually solved by subsection.
机组编排属于典型的组合优化问题，具有情况复杂、数据量大、优化目标和限制条件多等特点，通常采用分段解决。
应用推荐