A Random Exploring Optimization Algorithm:Wang-Yu Algorithm
LI Xiao-zheng · Journal of Beijing Jiaotong University · 2007
Inspired by the thought of netting fish in our daily life,Wang-Yu Algorithm starts from the most basic characteristics of the random exploring optimization and it ties up two special kinds of data-nets firstly in computer by using the tactics of random moving together.Then Wang-Yu Algorithm realizes the object of random exploring optimization from a new direction by netting orderly in the all range of exploring and promptly observing the situation after netting.From comparing Wang-Yu Algorithm with Genetic Algorithm in test experiment to the typical algorithm test functions,it is shown that the Wang-Yu Algorithm is more general and the more suitable to deal with the problem than Genetic Algorithm when few characteristics about the most excellent object are known before in a problem.