Accelerated genetic algorithms: Combined with local search techniques for fast and accurate global search
Authors:
- Chu Kwong ChakCCChu Kwong Chak
- Gang FengGFGang Feng
- 1 January 1995
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 378
Abstract
This paper discusses a combinatorial method to compute a global solution of a non-convex optimization problem. A hybrid algorithm is the synthesis of a genetic algorithm and a local search algorithm (e.g. nonlinear programming). The hybrid algorithm is not only faster than the genetic algorithm but also gives a more accurate solution. In addition, the length of chromosome required is much smaller. An abstract analysis of the hybrid algorithm is discussed based on which a convergent proof of this algorithm is derived. Finally, simulations are performed to show the efficiency of the algorithmKeywords
This publication has 4 references indexed in Scilit:
- Convergence analysis of canonical genetic algorithmsIEEE Transactions on Neural Networks, 1994
- A Modification of Davidon's Minimization Method to Accept Difference Approximations of DerivativesJournal of the ACM, 1967
- An efficient method for finding the minimum of a function of several variables without calculating derivativesThe Computer Journal, 1964
- A Rapidly Convergent Descent Method for MinimizationThe Computer Journal, 1963