随机搜索

We utilized the simulated annealing algorithm to solve this kind of problems in this paper.

该算法是一种新的随机搜索方法，它是近年来提出的一种适合于解决大规模组合优化问题的通用而有效的近似算法。

Genetic algorithms are a class of stochastic search methods based on Darwinian models of natural selection and evolution.

遗传算法是一种借鉴生物界自然选择和自然遗传机制的随机搜索算法。

Genetic algorithm is stochastic searching and optimization method using concept of natural evolution and genetics.

遗传算法是一种模仿生物自然进化过程的随机搜索和优化算法，其优势在于可以高效的处理传统搜索方法难以解决的非线性问题。

A real-coded genetic algorithm is adopted using the unimodal normal distribution crossover and the elitist model. And then, the stochastic search algorithm is used to optimize the elitist.

本文选择UNDX交叉算子作为遗传算法的主要算子，在保留当前最佳个体的同时，再对该最佳个体用随机搜索法搜索优化个体。

Much work has been done on multi-objective optimization methods to make them turn from deterministic searching algorithm to stochastic searching one, and from single objective optimizing method in nature to veritably vector optimization method. At present there are still many unsolved problems on it.

摘 要 多目标优化方法经历了一个从确定性搜索算法到随机搜索算法的过程，本质上仍是单目标优化的目标组合方法到真正意义上的向量优化方法的过程，至今仍在不断地发展中，但仍有大量未解决的问题。

Genetic arithmetic is a evolutional algorithm with stochastic search technology, it is also has the shortcomings with the prematurity ,slow on the convergence rate ,weak in the ability of local search ,which is appeared on the process of utilizing.

遗传算法是一种具有随机搜索技术的进化算法，但在运用过程中出现早熟、收敛速度慢、局部搜索能力差的缺点。

The ant colony algorithm is a kind of random search method that developed by coping the natural ant behavior, because of the characters of the characters of running impliedly side by side and searching overall, it makes ACA have advantage that other routine optimization algorithms cant own.

蚁群算法是模仿自然界的蚂蚁行为而发展起来的一种随机搜索方法，由于其隐含并行性和全局搜索特性，使其具有其他常规优化算法无法拥有的优点。

In order to solve the problem effectively, a GA-based strategy is given after the complete analysis of the features of GA, which is very efficient to solve large-scale, non-linear, uncontinuous and multiple optimums optimization problems.

论文在对GA分析的基础上，指出GA是一种通用性很强的自适应随机搜索算法，且对搜索空间要求不高，适用于全局优化，尤其在解决诸如大规模、非线性、不连续、多峰等复杂函数优化问题方面，更显示其优越性。

Among them, one of the most promising seems to be Simulation Annealing that aims to reach the optimization of an objective function by physically analogizing to an annealing process of malerial at high temperature. This involves in a transformation of optimization of a function in continuous domain into a combinatorial optimization in discrete domain, as well as the proper choice of various control parameters such as temperature, iterative number etc.

为此，目前主要采用三种基于随机搜索策略的鲁棒技术，其中模拟退火算法是最有希望的一种，该算法的核心思想是随机模拟物理上的物质退火过程，它主要涉及将连续域优化问题转换为离散的组合优化问题，以及合理地选择各种控制参数、迭代时间等。

In this dissertation, a new approach is presented by means of shape of centrodes on moving rigid body. By genetic algorithm, a series of good initial points can be produced automatically.

本文在连杆机构运动分析基础上，利用瞬心线的形状和位置特性确定实始搜索范围，并结合遗传算法的随机搜索特点来构造优化过程。

Further more, the simplified analysis method on stressed-skin effect of corrugated steel sheet is also discussed in detail.

此外还比较详细地探讨了蒙皮效应的简化分析方法。

If I had known her telephone number,I would have called her.

要是我知道她的电话号码，我就打电话给她了。