启发式的

Then, we used a new heuristic algorithm, Immune Algorithm to solve the problem of target assignment.

然后将一种新型的启发式算法－免疫算法用于解决目标分配问题。

For the above problem, two heuristic methods and a hybrid optimal algorithm that incorporates the branch and bound method with active schedule constru〓n algorithm are presented Computational results show the effectiveness of these methods.

对上述问题，给出了两个启发式方法和一个将分支定界法和活动调度构造算法相结合的混合最优算法。

It has achieved some success in solving combinational optimization problems.

蚁群算法是一种应用于组合优化问题的启发式搜索算法。

Ant Colony Optimization algorithm is a new heuristic algorithm to the combinatorial optimization problem.

蚁群算法是一种新兴的启发式算法。

As for 3-layer constrained via minimization problem (3CVM), a heuristic approach on the basis of segment-crossing graph model is presented. Two types of algorithm, global sense and local sense are combined into our algorithm.

对三层布线的通孔最少化问题（3CVM），提出了一个启发式算法，以线段—相交图为模型，分总体优化和局部优化两步对三层详细布线进行通孔优化处理。

A heuristic algorithm is presented for the containers to load cuboid goods with the same size.

给出了集装箱装载同一尺寸长方体货物问题的一种启发式算法。

On global optimal algorithms, a heuristic 0-1 Integer Liner Programming algorithm is achieved, which combines heuristic enumeration method and revised simplex method. Simulation experiments show that the degree and optimization efficiency in our algorithm is obviously improved compared with the MATLAB 7 bintprog function that is a 0-1 integer programming algorithm. Moreover our algorithm isn\'t relevant to the scale changes of Web services composition and candidate service sets, thus it is applicable for the scenes that the scales of Web services composition changed dynamically. But for Web services composition with service alliance, the algorithm is unable because the non-linear global optimal model of the fitness function and QoS constraints can\'t be expressed in linear mode.

在全局优化算法研究上，基于启发式0-1整线性规划算法结合了修正单纯形法和启发式枚举法，仿真实验表明该算法与MATLAB 7的0-1整数规划方法比较，在优化程度及优化效率上得到了显著改进，并且对服务组合和候选服务集合的规模变化没有明显的相关性，因而该算法可用于服务组合规模动态变化的场景，但该算法不能应用于存在服务联盟的非线性全局优化模型。

The backward heuristic search algorithm BHAO for general AND/OR graphs is presented, in terms of newly-defined heuristic function h and the principle that every subtree of the optimum solution tree is also optimum solution one.

根据新定义的启发式函数h以及广义AND／OR图的最佳解树之所有子树亦是最佳子解树的原理，提出了广义AND／OR图的自底向上的启发式搜索算法BHAO。

In this paper,a novel clustering algorithm DBSB (Density Based Spatial Clustering Method with Heuristically Selecting Border Object) is proposed.The algorithm fastly expands the clusters by a heuristical function to choose core objects in the border region of the known core object,and then merge some clusters by border objects.

本文提出了一种启发式选择边界对象的快速空间聚类算法DBSB，通过一个启发式函数近似选择相对于某个已知核心对象边界区域中的核心对象和边界对象，通过核心对象的序列来快速地扩展它们所在的簇，直至找到一些较小的簇。

The multi-stage Tabu Search fits for the situation where the problem has middle size, the quality of solution is important, and the speed is not restricted too much.(4) The combined algorithm which shares the advantages of HR and TS—high speed and high quality—is the most practicable one for middle-scale problems.

通过仿真实验对分枝定界算法、基于运行的启发式算法、多阶段禁忌搜索算法和组合算法进行一系列的对比研究，得出以下几点结论：(1)分枝定界算法只适用于问题规模小且对计算时间要求不高的场合，它是一种最优化算法；(2)启发式算法适合于求解大规模问题，尤其是实际应用中遇到的大型问题，对计算时间要求较高而对解的质量只要满意即可。

In the United States, chronic alcoholism and hepatitis C are the most common ones.

在美国，慢性酒精中毒，肝炎是最常见的。

If you have any questions, you can contact me anytime.

如果有任何问题，你可以随时联系我。