一种自适应随机优化算法

提出了一种新的基于群体搜索的随机优化算法。该算法的基本思想是：１） 像遗传算法那样，采用二进制串来表示问题的尝试解；２） 解串中每个二进制位的取值，由一可改变的概率分布控制；３）根据群体中最佳解串与最差解串编码结构上的差异，对相关的概率分布进行修改。文中给出的模拟实例，显示了新算法在求解函数全局优化问题中的有效性

An Adaptive Stochastic Optimization Algorithm

A new random optimization algorithm based on population search is proposed.The primary thought of this algorithm is as follows:1) similar to that in genetic algorithms,the trial solutions of the problem to solve are represented by binary strings; 2) the value of each bit of the solution strings is determined by a variable probability distribution;and 3) the probability distributions are modified according to the differences between the coding structures of the best and the worst strings in the population.Simulation results demonstrate the effectiveness of the proposed algorithm in solving the problem of functions global optimization.