Artificial intelligence (3rd ed.)
Artificial intelligence (3rd ed.)
Journal of Global Optimization
Real-coded memetic algorithms with crossover hill-climbing
Evolutionary Computation - Special issue on magnetic algorithms
A comparative study of differential evolution variants for global optimization
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Modular neuroevolution for multilegged locomotion
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Evolutionary lossless compression with GP-ZIP*
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Cooperative micro-particle swarm optimization
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Differential evolution algorithm with strategy adaptation for global numerical optimization
IEEE Transactions on Evolutionary Computation
Handling constraints in particle swarm optimization using a small population size
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Elitistic evolution: an efficient heuristic for global optimization
ICANNGA'09 Proceedings of the 9th international conference on Adaptive and natural computing algorithms
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
Microgenetic algorithms as generalized hill-climbing operators forGA optimization
IEEE Transactions on Evolutionary Computation
Accelerating Differential Evolution Using an Adaptive Local Search
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
This paper describes a novel algorithm for numerical optimization, which we call Simple Adaptive Climbing (SAC ). SAC is a simple efficient single-point approach that does not require a careful fine-tunning of its two parameters. Our algorithm has a close resemblance to local optimization heuristics such as random walk, gradient descent and, hill-climbing. However, SAC algorithm is capable of performing global optimization efficiently in any kind of space. Tested on 15 well-known unconstrained optimization problems, it confirmed that SAC is competitive against representative state-of-the-art approaches.