Performance analysis of clustering based genetic algorithm
In this work, performance analysis of Clustering based Genetic Algorithm (CGA) proposed in the literature has been undertaken. The proposed CGA on which the performance analysis of this paper is based involve the use of two centroids based clustering technique as a new method of chromosomes sel...
| Main Authors: | , , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English English |
| Published: |
IEEE
2016
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/52194/ http://irep.iium.edu.my/52194/ http://irep.iium.edu.my/52194/ http://irep.iium.edu.my/52194/7/52194.pdf http://irep.iium.edu.my/52194/13/55021-Performance%20Analysis%20of%20Clustering%20Based%20Genetic%20Algorithm_SCOPUS.pdf |
| Summary: | In this work, performance analysis of Clustering based
Genetic Algorithm (CGA) proposed in the literature has been
undertaken. The proposed CGA on which the performance
analysis of this paper is based involve the use of two
centroids based clustering technique as a new method of
chromosomes selection at the reproduction stage in a typical
Genetic Algorithm. Population Control and Polygamy mating
techniques were introduced to improve the performance
of the algorithm. Results obtained from the determination
of optimal solutions to the : Sphere; Schwefel 2.4; Beale
and another known optimization functions carried out in
this work shows that the proposed CGA converges to global
solutions within few iterations and can also be adopted
for function optimization aside from the route optimization
problem previously reported in Literature. |
|---|