A hybrid real-parameter genetic algorithm for function optimization

doi:10.1016/j.aei.2005.09.001

Return

A hybrid real-parameter genetic algorithm for function optimization

2006-01-01

172

PRE

Shun‐Fa Hwang

Rong-Song He

DOI：10.1016/j.aei.2005.09.001

Original

Original request for help

Save

Abstract

En 中文

One drawback of genetic algorithm is that it may spend much computation time in the encoding and decoding processes. Also. since genetic algorithm lacks hill-climbing capacity, it may easily fall in a trap and find a local minimum not the true solution. In this paper, a novel adaptive real-parameter simulated annealing genetic algorithm (ARSAGA) that maintains the merits of genetic alogrithm and simulated annealing is proposed. Adaptive mechanisms are also included to insure the solution quality and to improve the convergence speed. The performance of the proposed operators has been discussed in detail and compared to other operators, and the performance of the proposed algorithm is demonstrated in 16 benchmark functions and two engineering optimization problems. Due to their versatile characteristics, these examples are suitable to test the ability of the proposed algorithm. The results indicate that the global searching ability and the convergence speed of this novel hybrid algorithm are significantly better, even though small population size is used. Also, the proposed algorithm has good application to engineering optimization problems. Hence, the proposed algorithm is efficient and improves the drawbacks of genetic algorithm. (c) 2005 Elsevier Ltd. All rights reserved.

Keywords:

genetic algorithm

simulated annealing

adaptive mechanism

function optimization

design optimization

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.