It is a typical combinatorial optimization problem.
它是典型的组合优化问题。
The integrated design of cellular manufacturing system (CMS) is a combinatorial optimization problem.
单元制造系统的集成设计问题是一个组合优化问题。
Ant Colony algorithm is a novel simulated evolvement algorithm solving complicated combinatorial optimization problem and its typical feature is swarm intelligence.
蚁群算法是一种新颖的求解复杂组合优化问题的模拟进化算法，它具有典型的群体智能的特性。
Ant colony system is a novel simulated evolutionary algorithm, which provides a new method for complicated combinatorial optimization problems.
蚁群算法是一种新型的模拟进化算法，为求解复杂的组合优化问题提供了一种新的思路。
Distribution Network Structure planning is a complex combinatorial optimization problem, which is difficult to solve properly by using traditional optimization methods.
配电网网架规划是一个复杂的组合优化问题，传统的优化方法往往难以解决此类问题。
Optimal placement of switch device is a combinatorial optimization problem with reliability cost objective function.
分段开关优化配置是一种以可靠性费用最小为目标函数的组合优化问题。
The tabu search (TS) method is one of the modern optimization algorithms developed from local search. It is generally used in combinatorial optimization problem.
TS算法属于现代优化算法，是局部领域搜索法的推广，常用于求解组合优化问题。
The maximum flow problem is a classical combinatorial optimization problem.
最大流问题是一类经典的组合优化问题。
The maximum flow problem is one of the classical combinatorial optimization problems.
最大流问题是一个经典的组合优化问题。
The scheduling of logistic processes is a combinatorial optimization problem.
物流过程的调度是一个组合优化问题。
The assignment problem is a kind of combinatorial optimization problems.
分配问题是一个组合优化问题。
Layout problem is an important offshoot of Operation Research; it belongs to complex combinatorial optimization problem.
布局问题是运筹学的一个重要分支，属于复杂的组合优化问题。
It can be applied to solve in many combinatorial optimization problems.
它能应用到求解许多组合优化问题。
The ant algorithm is a class of population based bionic algorithm, which provides new methods for complex combinatorial optimization problem.
蚁群算法是基于群体的一种仿生算法，为求解复杂的组合优化方法问题提供了一种新思路。
Due to the high parallelism and recognition ability of the biomolecules in biochemical reactions, biomolecular computing behaves great advantage in solving combinatorial optimization problems.
由于生物分子在化学反应中具有高度的并行性和识别能力，使生物分子计算在解决组合优化问题中显示出巨大的优势。
Branch and Bound algorithm is a general method for solving Combinatorial Optimization Problems. Parallelization is an effective means to improve the algorithm performance.
分枝限界算法是一种求解组合优化问题的一般性方法，并行化是提高算法性能的有效手段。
Computation shows that the algorithm is efficient and can be used to solve the complicated combinatorial optimization problems such as machine scheduling.
计算表明，该算法具有较高的效率，能有效地求解机器排序等复杂的组合优化问题。
Redundancy allocation is a combinatorial optimization problem of system design.
冗余分配是系统设计中的组合优化问题。
Full Load Pickup and Delivery Problem(FLPDP) is an important combinatorial optimization problem existed extensively in the transportation domain.
满载装卸货问题是广泛存在于物流运输领域的重要组合优化难题。
This paper studies the problem of data association in multisensor multitarget detection under the condition of leakage and describes it as combinatorial optimization in mathematical programming.
研究了漏检情况下多传感器多目标检测中的数据关联问题，并将其描述为数学规划中组合最优化问题。
Packing problem is a typical combinatorial optimization problem, and has NPC difficulty in solving complexity.
布局问题是一种经典的组合优化问题，在求解复杂性上具有NP完全性。
Three dimension packing problem with multi constraints is a complicated combinatorial optimization, and is NP HARD problem. It is difficult to obtain on optimal solution.
多约束条件下的三维装箱问题是一个复杂的组合优化问题，属于NP-HARD问题，其求解是很困难的。
Transmission network expansion planning (TNEP) is a complex combinatorial optimization problem.
输电网络扩展规划问题是一个复杂的组合优化问题。
Three-dimensional component packing is a combinatorial optimization and NP-complete problem. It is difficult to find its exact global optimum.
三维布局问题属于组合最优化问题和NP完全问题，在一定时间内求其精确全局最优解是相当困难的。
An adaptive combinatorial optimization algorithm for solving this integrated optimization design problems is put forward.
针对一体化设计问题的求解要求提出了相应的组合优化算法。
An adaptive combinatorial optimization algorithm for solving this integrated optimization design problems is put forward.
针对一体化设计问题的求解要求提出了相应的组合优化算法。
应用推荐