Global optimization using evolutionary algorithm based on level set evolution and latin square

Authors:
Yuping Wang;Jinling Du;Chuangyin Dang
Affiliations:
School of Computer, Xidian University, Xi’an, China;School of Computer, Xidian University, Xi’an, China;Department of Manufacturing Engineering and Engineering Management, City University of Hong Kong, Hong Kong
Venue:
IDEAL'05 Proceedings of the 6th international conference on Intelligent Data Engineering and Automated Learning
Year:
2005

Citing 8
Cited 0

The globally convexized filled functions for global optimization

Applied Mathematics and Computation
Evolutionary computation: toward a new philosophy of machine intelligence

Evolutionary computation: toward a new philosophy of machine intelligence
An Introduction to Neural Networks

An Introduction to Neural Networks
SPT: a stochastic tunneling algorithm for global optimization

Journal of Global Optimization
New Classes of Globally Convexized Filled Functions for Global Optimization

Journal of Global Optimization
Evolutionary programming made faster

IEEE Transactions on Evolutionary Computation
An orthogonal genetic algorithm with quantization for globalnumerical optimization

IEEE Transactions on Evolutionary Computation
Evolutionary programming using mutations based on the Levy probability distribution

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a new crossover operator based on Latin square design is presented at first. This crossover operator can generate a set of uniformly scattered offspring around their parents, and it is of the ability of local search and thus can explore the search space efficiently. Then the level set of the objective function is evolved successively by crossover and mutation operators such that it gradually approaches to global optimal solution set. Based on these, a new evolutionary algorithm for nondifferentiable unconstrained global optimization is proposed and its global convergence is proved. At last, the numerical simulations are made for some standard test functions. The performance of the proposed algorithm is compared with that of two widely-cited algorithms. The results indicate the proposed algorithm is effective and has better performance than the compared algorithms for these test functions.