The maximum flow problem is one of the classical combinatorial optimization problems.
最大流问题是一个经典的组合优化问题。
Ant colony system is a novel simulated evolutionary algorithm, which provides a new method for complicated combinatorial optimization problems.
蚁群算法是一种新型的模拟进化算法，为求解复杂的组合优化问题提供了一种新的思路。
Computation shows that the algorithm is efficient and can be used to solve the complicated combinatorial optimization problems such as machine scheduling.
计算表明，该算法具有较高的效率，能有效地求解机器排序等复杂的组合优化问题。
Scheduling is one of the most important combinatorial optimization problems. It is very important in industrial production, manufacturing systems and other fields.
生产调度是一类重要的组合优化问题，在工业生产、制造系统等领域应用广泛。
The assignment problem is a kind of combinatorial optimization problems.
分配问题是一个组合优化问题。
This paper mainly studies some combinatorial optimization problems on computational molecular biology.
本文主要研究了计算分子生物学中的若干组合优化问题。
The research of the Parallel Immune Algorithm application will help to solve other combinatorial optimization problems.
并行免疫算法的应用研究将有助于其他组合优化问题的解决。
The path optimization problem belongs to combinatorial optimization problems, which is solved generally by using heuristic search algorithm.
路径优化问题属于组合优化问题，而解决组合优化问题一般使用启发式搜索算法。
In order to solve NP - shop scheduling combinatorial optimization problems, an immune forgotten algorithm for job shop scheduling is proposed.
为了解决车间调度NP组合优化的难题，提出了基于免疫遗忘的车间调度算法。
However, the traditional algorithms have the problems of early convergence or stagnation in the process of combinatorial optimization problems.
然而，基本蚁群算法在求解组合优化问题过程中容易出现过早收敛或停滞现象。
It is well-known that the optimal storage on sequential access peripheral problems is a fundamental problem in combinatorial optimization problems.
顺序存取设备的最优存储是组合优化中的一个重要问题。
The Algorithm has very wide generality and very good efficiency, its basic principle can widely be used in solving large scale combinatorial optimization problems.
该算法通用性强，效率高，其基本原理可广泛应用于求解大规模的组合优化问题。
The problem of collecting and delivery shunting of non-through wagon flow on the actinoid private line belongs to a kind of the 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.
给出了列队竞争算法解组合优化问题的框架和确定变异邻域的两条原则。
Aiming at combinatorial optimization problems, this paper carries out the following main research work based on EDA. A hybrid EDA is proposed to solve the multidimensional knapsack problems (MKP).
本文针对组合优化问题，基于分布估计算法主要开展了如下研究：针对多维背包问题，设计了一种混合分布估计算法。
After lots of experiments ACO has exhibited its excellent performance and efficiency in experiments for solving a great lot of combinatorial optimization problems, and now it is used in many areas.
大量实验结果表明，它在解决许多组合优化问题时都能表现出较好的求解能力，目前此算法已经得到了比较广泛的应用。
This theory will Virtually have analogy between combinatorial optimization and thermal equilibrium problems of statistical mechanics and open up a new way for 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.
分枝限界算法是一种求解组合优化问题的一般性方法，并行化是提高算法性能的有效手段。
Branch and Bound algorithm is a general method for solving Combinatorial Optimization Problems. Parallelization is an effective means to improve the algorithm performance.
分枝限界算法是一种求解组合优化问题的一般性方法，并行化是提高算法性能的有效手段。
应用推荐