Enhancing the efficiency of the extended compact genetic algorithm
20 May 2008Duque, T., Goldberg, D. E., Sastry, K. (2008). IlliGAL Report No. 2008006. University of Illinois at Urbana-Champaign, Urbana IL. [Full Paper - PDF] [Full Paper - PS].
Abstract:
Evolutionary Algorithms are largely used search and optimization procedures that, when properly designed, can solve intractable problems in tractable polynomial time. Efficiency enhancements are used to turn them from tractable to practical.
In this paper we show preliminary results of two efficiency enhancements proposed for the Extended Compact Genetic Algorithm. First, a model building enhancement was used to reduce the complexity of the process from O(n3) to O(n2), speeding up the algorithm by 1000 times on a 4096 bits problem. Then, local-search hybridization was used to reduce the population size by at least 32 times, reducing the memory and running time required by the algorithm. These results draw the first steps toward a competent and efficient Genetic Algorithm.
Related Posts:
- Efficient cluster optimization using a hybrid extended compact genetic algorithm with a seeded population
- On extended compact genetic algorithm
- Silicon cluster optimization using extended compact genetic algorithm
- χ-ary extended compact genetic algorithm in C++
- Scalability of a hybrid extended compact genetic algorithm for ground state optimization of clusters
No comments yet
