An empirical comparison of three novel genetic algorithms

Hui‐Yuan Fan (SER Turbomachinery Research Center, School of Energy and Power Egineering, Xi’an Jiaotong University, Xi’an, P.R. China)
Jane Wei‐Zhen Lu (Department of Building & Construction, City University of Hong Kong, Kowloon, Hong Kong)
Zong‐Ben Xu (Faculty of Science, Xi’an Jiaotong University, Xi’an, P.R. China)

Engineering Computations

ISSN: 0264-4401

Publication date: 1 December 2000

Abstract

Genetic algorithms have been extensively used in different domains as a type of robust optimization method. They have a much better chance of achieving global optima than conventional gradient‐based methods which usually converge to local sub‐optima. However, convergence speeds of genetic algorithms are often not good enough at their current stage. For this reason, improving the existing algorithms becomes a very important aspect of accelerating the development of the algorithms. Three improved strategies for genetic algorithms are proposed based on Holland’s simple genetic algorithm (SGA). The three resultant improved models are studied empirically and compared, in feasibility and performance evaluation, with a set of artificial test functions which are usually used as performance benchmarks for genetic algorithms. The simulation results demonstrate that the three proposed strategies can significantly improve the SGA.

Keywords

Citation

Fan, H., Wei‐Zhen Lu, J. and Xu, Z. (2000), "An empirical comparison of three novel genetic algorithms", Engineering Computations, Vol. 17 No. 8, pp. 981-1002. https://doi.org/10.1108/02644400010360901

Download as .RIS

Publisher

:

MCB UP Ltd

Copyright © 2000, MCB UP Limited

Please note you might not have access to this content

You may be able to access this content by login via Shibboleth, Open Athens or with your Emerald account.
If you would like to contact us about accessing this content, click the button and fill out the form.
To rent this content from Deepdyve, please click the button.