Parallel exploitation in estimated basins of attraction: a new derivative-free optimization algorithm

Authors:
Ying Lin;Jing-Hui Zhong;Jun Zhang
Affiliations:
SUN Yat-sen University, Guangzhou, China;SUN Yat-sen University, Guangzhou, China;SUN yat-sen University, Guangzhou, China
Venue:
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Year:
2011

Citing 9
Cited 0

Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
Direct search methods: then and now

Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 Vol. IV: optimization and nonlinear equations
Mesh Adaptive Direct Search Algorithms for Constrained Optimization

SIAM Journal on Optimization
Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Studies in Fuzziness and Soft Computing)

Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Studies in Fuzziness and Soft Computing)
A Novel Genetic Algorithm with Orthogonal Prediction for Global Numerical Optimization

SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning
Adaptive particle swarm optimization

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hybrid genetic algorithm using a forward encoding scheme for lifetime maximization of wireless sensor networks

IEEE Transactions on Evolutionary Computation - Special issue on preference-based multiobjective evolutionary algorithms
MP-EDA: a robust estimation of distribution algorithm with multiple probabilistic models for global continuous optimization

SEAL'10 Proceedings of the 8th international conference on Simulated evolution and learning
Evolutionary programming made faster

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Direct search (DS) and evolutionary algorithms (EAs) are two of the most representative branches of derivative-free optimization methods. However, traditional DS becomes deficient in multimodal problems, while EAs suffer from long computational time due to the blind search caused by randomness in evolutionary operators. This paper proposes a new derivative-free optimization algorithm that addresses both the above issues, avoiding prematurity while maintaining fast convergence speed. The new algorithm first estimates basins of attractions in the search space by analyzing samples of the objective function. An adaptive exploitation method with the ability to predict promising search directions is then applied to search the estimated basins in parallel. The new algorithm is evaluated on both unimodal and multimodal benchmark functions. Experimental results show that the algorithm is a promising global optimizer with fast convergence speed.