A new evolutionary algorithm based on hybrid crossovers and intermittent mutation for global optimization of complex functions with high dimensions is proposed.
通过混合使用多种杂交算子并辅之以间歇变异,提出了一种求解高维复杂函数全局优化问题的新型演化算法。
Chapter 5 introduces adaptive monte carlo method (AQMC) for global optimization.
第5章介绍了自适应拟蒙特卡罗全局优化(AQMC)方法。
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.
借用遗传算法中种群的概念,介绍了一种解全局优化的拟蒙特卡罗自适应搜索算法。
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.
本文研究了一种求解连续变量空间全局优化的进化算法,基于分片二维搜索的修正微分进化算法。
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.
本文研究了一种求解连续变量空间全局优化的进化算法,基于分片二维搜索的修正微分进化算法。
应用推荐