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

Abstract

To promote the global search ability of the original state transition algorithm, a new operator called axesion is suggested, which aims to search along the axes and strengthen single dimensional search. Several benchmark minimization problems are used to illustrate the advantages of the improved algorithm over other random search methods. The results of numerical experiments show that the new transformation can enhance the performance of the state transition algorithm and the new strategy is effective and reliable.

5 pages, 6 figures

Cited by in corpus (7)

• A Statistical Study on Parameter Selection of Operators in Continuous State Transition Algorithm
• Discrete State Transition Algorithm for Unconstrained Integer Optimization Problems
• Nonlinear system identification and control using state transition algorithm
• A Multiobjective State Transition Algorithm for Single Machine Scheduling
• A matlab toolbox for continuous state transition algorithm
• A Comparative Study of STA on Large Scale Global Optimization
• Multiagent based state transition algorithm for global optimization