Abstract:

We analyse the global optimization problems of the cloud search algorithm, and the algorithm can be seen throughout the search process which includes drift operator, rain clouds of the Health operator, contraction expansion operator. If the contraction of the expansion operator fails, then the algorithm will compare the case of a bad search. In this case, we use the knowledge of probability theory analysis of the convergence of the algorithm. The results indicates that the search algorithm converges to the probability of a global optimal solution.

Key words: cloud search algorithm;convergence;convergence probability