An adaptive combinatorial optimization algorithm for solving this integrated optimization design problems is put forward.
针对一体化设计问题的求解要求提出了相应的组合优化算法。
Ant colony system is a novel simulated evolutionary algorithm, which provides a new method for complicated 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.
分枝限界算法是一种求解组合优化问题的一般性方法，并行化是提高算法性能的有效手段。
Ant Colony algorithm is a novel simulated evolvement algorithm solving complicated combinatorial optimization problem and its typical feature is swarm intelligence.
蚁群算法是一种新颖的求解复杂组合优化问题的模拟进化算法，它具有典型的群体智能的特性。
Computation shows that the algorithm is efficient and can be used to solve the complicated combinatorial optimization problems such as machine scheduling.
计算表明，该算法具有较高的效率，能有效地求解机器排序等复杂的组合优化问题。
The ant algorithm is a class of population based bionic algorithm, which provides new methods for complex combinatorial optimization problem.
蚁群算法是基于群体的一种仿生算法，为求解复杂的组合优化方法问题提供了一种新思路。
The Algorithm has very wide generality and very good efficiency, its basic principle can widely be used in solving large scale combinatorial optimization problems.
该算法通用性强，效率高，其基本原理可广泛应用于求解大规模的组合优化问题。
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.
针对贷款组合优化决策模型的求解问题，论文提出了用于求解该问题的二进制粒子群算法，并阐明了算法的具体实现过程。
Ant colony algorithm is a novel simulated evolutionary algorithm based on group cooperation and can be applied to solve hard discrete combinatorial optimization problem.
蚁群算法是基于群体合作的一类仿生算法，适合于解困难的离散组合优化问题。
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.
给出了列队竞争算法解组合优化问题的框架和确定变异邻域的两条原则。
To gain excellent efficiency of role assignment in robot soccer strategy system, a role assignment algorithm based on combinatorial optimization is presented.
为了在机器人足球策略系统中获得良好的角色分配效率，提出了基于组合最优的角色分配算法。
The research of the Parallel Immune Algorithm application will help to solve other combinatorial optimization problems.
并行免疫算法的应用研究将有助于其他组合优化问题的解决。
In testing the effectiveness of the proposed method, the quantum algorithm for combinatorial optimization both for function optimization problem or a traveling salesman, had achieved good results.
在对所提算法有效性的测试中，量子组合优化算法无论对函数优化还是旅行商问题，都取得了较好的效果。
In order to solve NP - shop scheduling combinatorial optimization problems, an immune forgotten algorithm for job shop scheduling is proposed.
为了解决车间调度NP组合优化的难题，提出了基于免疫遗忘的车间调度算法。
Ant colony algorithm is a new intelligent optimization algorithm for solving combinatorial optimization problem or function optimization problem.
蚁群算法是一种新型的用于求解组合优化或函数优化问题的智能优化算法。
The path optimization problem belongs to combinatorial optimization problems, which is solved generally by using heuristic search algorithm.
路径优化问题属于组合优化问题，而解决组合优化问题一般使用启发式搜索算法。
In Chapter 1, we give a brief introduction for combinatorial optimization, computational biology and algorithm analysis.
在论文的第一章里，首先简要介绍了组合优化，计算生物学问题，算法和时间复杂性等基本概念。
Then applied a hybrid ant colony algorithm to accomplish combinatorial optimization of task allocation.
其次利用混合蚁群算法快速收敛和分布式求解的特点实现任务分配的组合优化。
In addition, simulated annealing algorithm for the combinatorial optimization problem here is also given.
此外，利用模拟退火算法成功地解决了该组合优化问题。
This paper introduces a heuristic algorithm to solve a large-scale combinatorial optimization problem for transportation problem with constrained resources.
介绍了一种求解资源约束条件下的大规模组合优化运输问题的启发式方法。
Ant system algorithm is a kind of evolutionary algorithms, which is efficient in solving combinatorial optimization problem.
蚁群算法是一种进化算法，适合解决组合优化问题，指派问题是组合优化问题中的一个分支。
Ant system algorithm is a kind of evolutionary algorithms, which is efficient in solving combinatorial optimization problem.
蚁群算法是一种进化算法，适合解决组合优化问题，指派问题是组合优化问题中的一个分支。
应用推荐