Research About A Random Exploring Optimization Algorithm

Inspired by the thought of netting fish in our daily life, WANGYU 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 WANGYU 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 WANGYU Algorithm with Genetic Algorithm in test experiment to the typical algorithm test functions, it is shown that the WANGYU 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.WANGYU Algorithm is a random exploring optimization algorithm which mixes definitude and random, and it not only cares for the situation in general but also gives prominence to important place. Firstly, a concrete WANGYU Algorithm example was analyzed overall, and experiment test was done in most aspect. Then, based the experiment results which has been get from concrete example, author introduces the theory of relative extreme value and researches the theory about the WANGYU Algorithm. Finally, according to the theory of relative extreme value and the real need, a broad sense WANGYU Algorithm was introduced after inducing and expanding the now concrete example.11 figures, 5 tables, 24 references...