State transition algorithm
From MaRDI portal
Publication:2358898
Abstract: In terms of the concepts of state and state transition, a new heuristic random search algorithm named state transition algorithm is proposed. For continuous function optimization problems, four special transformation operators called rotation, translation, expansion and axesion are designed. Adjusting measures of the transformations are mainly studied to keep the balance of exploration and exploitation. Convergence analysis is also discussed about the algorithm based on random search theory. In the meanwhile, to strengthen the search ability in high dimensional space, communication strategy is introduced into the basic algorithm and intermittent exchange is presented to prevent premature convergence. Finally, experiments are carried out for the algorithms. With 10 common benchmark unconstrained continuous functions used to test the performance, the results show that state transition algorithms are promising algorithms due to their good global search capability and convergence property when compared with some popular algorithms.
Recommendations
- The principle of state transition algorithm and its applications
- Transition functions for evolutionary algorithms on continuous state-space
- Particle state change algorithm
- A multiobjective state transition algorithm for single machine scheduling
- Convergence of a New Evolutionary Computing Algorithm in Continuous State Space
Cites work
- `` Direct Search Solution of Numerical and Statistical Problems
- A heuristic approach for finding the global minimum: Adaptive random search technique
- A hybrid descent method for global optimization
- A hybrid particle swarm optimization and tabu search algorithm for order planning problems of steel factories based on the make-to-stock and make-to-order management architecture
- A mixed simulated annealing-genetic algorithm approach to the multi-buyer multi-item joint replenishment problem: advantages of meta-heuristics
- A modified genetic algorithm for optimal control problems
- A Simplex Method for Function Minimization
- A study of particle swarm optimization particle trajectories
- An Introduction to Markov Processes
- Continuous functions minimization by dynamic random search technique
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 852844 (Why is no real title available?)
- Minimization by Random Search Techniques
- Random optimization
Cited in
(9)- Particle state change algorithm
- A new multi-threshold image segmentation approach using state transition algorithm
- Chaos-enhanced Cuckoo search optimization algorithms for global optimization
- Global solutions to a class of CEC benchmark constrained optimization problems
- A discrete state transition algorithm for generalized traveling salesman problem
- A generalized state-splitting algorithm
- The principle of state transition algorithm and its applications
- Nonlinear system identification and control using state transition algorithm
- Interval type-2 fuzzy programming method for risky multicriteria decision-making with heterogeneous relationship
This page was built for publication: State transition algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2358898)
