Title: A fast evolutionary algorithm with searching preference

Authors: Fangqing Gu; Hai-lin Liu; Xueqiang Li

Addresses: School of Applied Mathematics, Guangdong University of Technology, Guangzhou, China ' School of Applied Mathematics, Guangdong University of Technology, Guangzhou, China ' School of Applied Mathematics, Guangdong University of Technology, Guangzhou, China

Abstract: Evolutionary algorithm (EA) has been successfully applied to many numerical optimisation problems in recent years. However, EA has rather slow convergence rates on some optimisation problems. In this paper, a fast evolutionary algorithm (FEA) with searching preference is proposed. Our basic idea is that the better an individual is, the more resources are invested to search the region close to the individual. Two techniques are applied to achieve it: making the best individual found so far always take part in crossover and mutation, and proposing a novel crossover and mutation operator based on simulated annealing. Obviously, the search process emphasises the region around the best individual. Furthermore, we can prove that FEA converges to a global optimum in probability. Numerical simulations are conducted for 19 standard test functions. The performance of FEA is compared with three EAs FEP, OGA/Q and LEA that have been published recently. The results indicate that FEA is effective and efficient. Furthermore, the result obtained by FEP is better than the best result found so far for ƒ₈.

Keywords: fast evolutionary algorithm; FEA; optimisation problem; simulated annealing; searching preference; numerical simulation.

DOI: 10.1504/IJCSE.2016.074563

International Journal of Computational Science and Engineering, 2016 Vol.12 No.1, pp.29 - 37

Received: 17 Jul 2012
Accepted: 11 Mar 2013
Published online: 06 Feb 2016 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article