Genetic algorithms (GAs) with self-adapting step size can search the best solution directly and more likely to acquire the global optimum result.
具有自适应步长的遗传算法可以直接搜索全局最优解。
Meanwhile, we use a fast simulation annealing algorithm in the inversion, which can overcome the limitation of the local extremum of objective function, and acquire a global optimum result.
同时，在具体反演中使用快速模拟退火算法，可以克服目标函数局部极值的限制，从而获得全局最优解。
The example result shows that in the genetic algorithm the optimum global solution can be gained and the convergence speed is fast.
算例结果表明，用该方法能以较快的速度收敛于全局最优解。
The example result shows that in the genetic algorithm the optimum global solution can be gained and the convergence speed is fast.
算例结果表明，用该方法能以较快的速度收敛于全局最优解。
应用推荐