演化硬件中变异概率对进化算法首次命中时间的影响

Influence of Mutation Probability on the First Hitting Time of Evolutionary Algorithms in Evolvable Hardware

在（1＋1）EAs中，采用马尔可夫链推移时间分析法，推导出了平均首次命中时间的表达式。从理论上分析了变异概率对平均首次命中时间的影响。结果表明适当的变异概率会缩短平均首次命中时间，加快进化算法的寻优时间。

The expression of the mean first hitting time is obtained for （ 1 ＋ 1 ） evolutionary algorithms （EAs） in the analytical approach to the passage time of Markov chain. The influence of mutation probability on the mean first hitting time is analyzed theoretically. The results show that proper mutation probability can shorten the mean first hitting time, and quicken optimization time of EAs.