self-adaptive step random search method 自适应步长随机搜索法
It is proved that the random search method is most adaptive to solve the problem.
计算结果表明，随机搜索法对此类问题具有非常好的适应性。
By borrowing the ideas of population from genetic algorithms, we introduce an adaptive random search in quasi_Monte Carlo method (AQMC) for global optimization.
借用遗传算法中种群的概念，介绍了一种解全局优化的拟蒙特卡罗自适应搜索算法。
It introduces the natural number coding method, adaptive probabilities of crossover and mutation, and furthermore, makes use of heuristic information to improve search efficiency effectively.
算法采用自然数编码，自适应的交叉变异算子，并融入启发式信息有效地提高了搜索效率。
应用推荐