A fast evolutionary algorithm with searching preference
by Fangqing Gu; Hai-lin Liu; Xueqiang Li
International Journal of Computational Science and Engineering (IJCSE), Vol. 12, No. 1, 2016

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 ƒ₈.

Online publication date: Sat, 06-Feb-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com