A new transformation into State Transition Algorithm for finding the global minimum.pdfVIP

A new transformation into State Transition Algorithm for finding the global minimum Xiaojun Zhou, Chunhua Yang and Weihua Gui Abstract— To promote the global search ability of the original where xk stands for a state, corresponding to a solution of state transition algorithm, a new operator called axesion is the optimization problem; Ak and Bk are state transition suggested, which aims to search along the axes and strengthen matrixes, which are usually transformation operators; uk is single dimensional search. Several benchmark minimization problems are used to illustrate the advantages of the improved the function with variables xk and history states; f is the algorithm over other random search methods. The results of objective function or evaluation function. numerical experiments show that the new transformation can Using various types of space transformation for reference, enhance the performance of the state transition algorithm and three special state transformation operators are defined to the new strategy is effective and reliable. solve continuous function optimization problems. I. INTRODUCTION (1) Rotation transformation HE basic random optimization(BRO) was proposed by 1 x = x + α R x (2) k+1 k r k TMatyas[1] in 1965, and it is proved that the BRO can n xk