Research on Fast Evolutionary Algorithms Based on Probabilistic Models

Xiaolin Yang · Dianzi xuebao · 2001

This paper disscusses the probabilistic model evolutionary algorithms which are a class of new algorithms proposed recently.After introducing the original and the principles of these classes of algorithms,the paper analyzes the complex computation caused by the complex models.Based on this,a new fast evolutionary algorithm based on probabilistic models is proposed.Also,a fast algorithm which uses the Bayes network model combined with the climbing-hill searching is realized.The experimental results show that the new algorithm has quick,reliable and accurate performance.

Read the paper · More papers on PaperTik