Kumara Sastry

Silicon cluster optimization using extended compact genetic algorithm

Sastry, K., Xiao, G. (2001). IlliGAL report no. 2001016. University of Illinois at Urbana-Champaign. [Full paper - PDF] [Full paper - PS] [Presentation slides].

Abstract:
This paper presents an efficient cluster optimization algorithm. The proposed algorithm uses extended compact genetic algorithm (ECGA), one of the competent genetic algorithms (GAs) coupled with Nelder-Mead simplex local search. The lowest energy structures of silicon clusters with 4-11 atoms have been successfully predicted. The minimum population size and total number of function (potential energy of the cluster) evaluations required to converge to the global optimum with a reliability of 96% have been empirically determined and are O(n^4.2) and O(n^8.2) respectively. The results obtained indicate that the proposed algorithm is highly reliable in predicting globally optimal structures. However, certain efficiency techniques have to be employed for predicting structures of larger clusters to reduce the high computational cost due to function evaluation.

Related Posts:

• Efficient cluster optimization using a hybrid extended compact genetic algorithm with a seeded population
• Scalability of a hybrid extended compact genetic algorithm for ground state optimization of clusters
• On extended compact genetic algorithm
• Enhancing the efficiency of the extended compact genetic algorithm
• χ-ary extended compact genetic algorithm in C++

Comments are closed.