Chapter 5 introduces adaptive monte carlo method (AQMC) for global optimization.
第5章介绍了自适应拟蒙特卡罗全局优化(AQMC)方法。
In this paper, the method of region constriction for global optimization is proposed.
对求解无约束最优化问题，本文给出了一个区间压缩方法。
With these concepts, integral optimality conditions for global optimization are obtained.
利用这些概念，得到了总极值的最优性条件。
This paper proposes a direct search algorithm for global optimization and multi-peak searching of functions with boundary constraints.
针对边界约束函数全局最优化和多峰寻优问题，提出一种直接搜索算法。
The smoothing method is a heuristic method for global optimization, which is much applicable in the research area of molecular conformations.
平滑方法是全局优化的一种启发式方法，在分子构像优化问题中得到大量应用。
Search techniques such as Genetic Algorithms, Simulated Annealing, Tabu Search and Random Walk Algorithms have been used extensively for global optimization.
搜索技术，诸如遗传算法，模拟退火算法，禁忌搜索和随机移动算法，已经广泛应用于全局优化。
By borrowing the ideas of population from genetic algorithms, we introduce an adaptive random search in quasi_Monte Carlo method (AQMC) for global optimization.
借用遗传算法中种群的概念，介绍了一种解全局优化的拟蒙特卡罗自适应搜索算法。
A new evolutionary algorithm based on hybrid crossovers and intermittent mutation for global optimization of complex functions with high dimensions is proposed.
通过混合使用多种杂交算子并辅之以间歇变异，提出了一种求解高维复杂函数全局优化问题的新型演化算法。
The numerical simulations show that each design solution satisfies all the compulsory criterions and the new method has a better ability for global optimization.
数值仿真结果表明，所有优化结果的性能指标均满足必备指标要求，且新方法具有很强的全局搜索能力。
As a new type of searching method for global optimization, Genetic algorithms has some merits such as intelligence searching, parallel mode, robust and wide application.
遗传算法作为一种新的全局优化搜索方法，具有智能性搜索、并行式计算、鲁棒性强、应用范围广等优点。
Through embedding a gradient descend operator into the generic algorithm, a hybrid algorithm is achieved with fast convergence and great probability for global optimization.
在遗传算法中嵌入一个梯度下降算子，使得混合算法既有较快的收敛性，又能以较大概率得到全局极值。
In this paper, we study a new kind of evolutionary algorithm for global optimization over continuous Spaces, a revision of Differential evolution based on piecewise two-dimensional search.
本文研究了一种求解连续变量空间全局优化的进化算法，基于分片二维搜索的修正微分进化算法。
Global guidelines that specify access plan parameters that are to be considered for all the statements while this optimization profile is in effect.
指定优化概要文件生效后需要对所有语句考虑的访问计划参数。
"Egencia's global reporting platform and services help corporations consolidate travel data from all points of sale, providing powerful insight for program and policy optimization," said Greyber.
“易信达的全球报告平台和服务可以帮助企业整合所有的营业网点的差旅数据，这样可以提供对项目和政策优化强有力的见解”，Greyber说道。
Optimization also involves techniques for solving large-scale, discrete, nonlinear, multiobjective, and global problems.
最优化也包括解决大规模，离散，非线性，多目标和全球化问题的技术。
Be inspired from natural plant growth, this paper proposes a bionic algorithm for solving the global optimization of nonlinear integer programming.
从大自然植物生长中得到启发，提出了一种求解非线性整数规划全局最小解的仿生算法。
This paper presents an improved fast simulated annealing algorithm based on the analysis on deterministic method and simulated annealing algorithm for solving global optimization problems.
基于对求解全局优化问题的确定性方法和模拟退火算法的分析，文中提出了一种改进的快速模拟退火算法。
Then, we consider a new filled function method with parameter free for solving general global optimization problems.
然后，对于一般结构的全局优化问题，我们给出了一个新的无参数的填充函数方法。
Evolutionary algorithms are one of the effective algorithms for hard optimization, global optimization and multiobjective optimization problems, which are attached more and more importance to.
进化算法作为处理复杂函数最优化、全局最优化和多目标最优化问题的一种有效算法，正日益受到人们的重视。
Evolutionary Programming (EP), a multi agent stochastic optimization technique, can lead to global optimal solutions for complex problems.
进化规划(EP)是一种随机优化技术，它可以发现全局最优解。
The algorithms with a high degree of optimization of the global routing for gate array and the channel routing are studied and proposed.
本文研究并提出了优化程度较高的退火模拟门阵列总体布线及平行通道区布线算法。
In this paper, a filled function method for solving global optimization problems with inequality and equality constraints is proposed.
提出了一种解决含有等式约束及不等式约束的全局优化问题的填充函数方法。
Simulated evolution and simulated annealing are two stochastic search algorithms for solving the global optimization problems. They have been widely used in different engineering areas.
模拟进化和模拟退火是解决全局优化问题的随机搜索技术，它们在工程领域有着广泛的应用。
In this paper, a new auxiliary function with one parameter on box constrained for escaping the current local minimizer of global optimization problem is proposed.
本文首先对箱子约束全局最优化问题提出了一个新的辅助函数，该函数能跳出当前的局部极小点。
In this paper a global optimization algorithm is proposed for some programming problem (p) with additional multiplicative constraints, which can be applied to finance and economics and so on.
对广泛应用于金融及经济等实际问题中的一类带有多乘积约束的线性规划问题提出一种全局优化算法。
In this paper a global optimization algorithm is proposed for some programming problem (p) with additional multiplicative constraints, which can be applied to finance and economics and so on.
对广泛应用于金融及经济等实际问题中的一类带有多乘积约束的线性规划问题提出一种全局优化算法。
应用推荐