It is a typical combinatorial optimization problem.
它是典型的组合优化问题。
The integrated design of cellular manufacturing system (CMS) is a combinatorial optimization problem.
单元制造系统的集成设计问题是一个组合优化问题。
Optimal placement of switch device is a combinatorial optimization problem with reliability cost objective function.
分段开关优化配置是一种以可靠性费用最小为目标函数的组合优化问题。
Ant colony system is a novel simulated evolutionary algorithm, which provides a new method for complicated combinatorial optimization problems.
蚁群算法是一种新型的模拟进化算法，为求解复杂的组合优化问题提供了一种新的思路。
Ant Colony algorithm is a novel simulated evolvement algorithm solving complicated combinatorial optimization problem and its typical feature is swarm intelligence.
蚁群算法是一种新颖的求解复杂组合优化问题的模拟进化算法，它具有典型的群体智能的特性。
The maximum flow problem is a classical combinatorial optimization problem.
最大流问题是一类经典的组合优化问题。
The scheduling of logistic processes is a combinatorial optimization problem.
物流过程的调度是一个组合优化问题。
The maximum flow problem is one of the classical combinatorial optimization problems.
最大流问题是一个经典的组合优化问题。
Layout problem is an important offshoot of Operation Research; it belongs to complex combinatorial optimization problem.
布局问题是运筹学的一个重要分支，属于复杂的组合优化问题。
The ant algorithm is a class of population based bionic algorithm, which provides new methods for complex combinatorial optimization problem.
蚁群算法是基于群体的一种仿生算法，为求解复杂的组合优化方法问题提供了一种新思路。
Transmission network expansion planning (TNEP) is a complex combinatorial optimization problem.
输电网络扩展规划问题是一个复杂的组合优化问题。
Packing problem is a typical combinatorial optimization problem, and has NPC difficulty in solving complexity.
布局问题是一种经典的组合优化问题，在求解复杂性上具有NP完全性。
Computation shows that the algorithm is efficient and can be used to solve the complicated combinatorial optimization problems such as machine scheduling.
计算表明，该算法具有较高的效率，能有效地求解机器排序等复杂的组合优化问题。
Full Load Pickup and Delivery Problem(FLPDP) is an important combinatorial optimization problem existed extensively in the transportation domain.
满载装卸货问题是广泛存在于物流运输领域的重要组合优化难题。
The properties of the joint probabilistic data association(JPDA)are analyzed, and data association is reduced to a sort of constraint combinatorial optimization problem.
通过对多目标联合概率数据关联方法性能特征的分析，将其归结为一类约束组合优化问题。
The problem of maximizing a submodular set function with multiple constraints is considered, which has important application in combinatorial optimization theory.
提出了多维约束下下模函数最大值问题，分析其在组合优化中的重要应用。
The Algorithm has very wide generality and very good efficiency, its basic principle can widely be used in solving large scale combinatorial optimization problems.
该算法通用性强，效率高，其基本原理可广泛应用于求解大规模的组合优化问题。
Ant colony algorithm is a novel simulated evolutionary algorithm based on group cooperation and can be applied to solve hard discrete combinatorial optimization problem.
蚁群算法是基于群体合作的一类仿生算法，适合于解困难的离散组合优化问题。
Distribution network planning is a complicated, nonlinear combinatorial optimization problem.
配电网网架优化规划是一个复杂的非线性组合优化问题。
However, the traditional algorithms have the problems of early convergence or stagnation in the process of combinatorial optimization problems.
然而，基本蚁群算法在求解组合优化问题过程中容易出现过早收敛或停滞现象。
The research of the Parallel Immune Algorithm application will help to solve other combinatorial optimization problems.
并行免疫算法的应用研究将有助于其他组合优化问题的解决。
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.
给出了列队竞争算法解组合优化问题的框架和确定变异邻域的两条原则。
Distribution network reconfiguration is a complex and nonlinear combinatorial optimization problem.
配电网络重构是一个复杂的非线性组合优化问题。
Scheduling is one of the most important combinatorial optimization problems. It is very important in industrial production, manufacturing systems and other fields.
生产调度是一类重要的组合优化问题，在工业生产、制造系统等领域应用广泛。
This paper brings forward the binary improved particle swarm optimization algorithm for decision of loans combinatorial optimization problem, and illustrates the detailed realization of the algorithm.
针对贷款组合优化决策模型的求解问题，论文提出了用于求解该问题的二进制粒子群算法，并阐明了算法的具体实现过程。
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.
研究了漏检情况下多传感器多目标检测中的数据关联问题，并将其描述为数学规划中组合最优化问题。
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问题，其求解是很困难的。
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问题，其求解是很困难的。
应用推荐