A novel clustering based genetic algorithm for route optimization
Genetic Algorithm (GA), a random universal evolutionary search technique that imitates the principle of biological evolution has been applied in solving various problems in different fields of human endeavor. Despite it strength and wide range of applications, optimal solution may not be feasible in...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English English English |
| Published: |
Elsevier B.V.
2016
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/52191/ http://irep.iium.edu.my/52191/ http://irep.iium.edu.my/52191/ http://irep.iium.edu.my/52191/3/52191_A%20novel%20clustering%20based%20genetic%20algorithm%20for%20route%20optimization_pdf.pdf http://irep.iium.edu.my/52191/4/52191_A%20novel%20clustering%20based%20genetic%20algorithm%20for%20route%20optimization_wos.pdf http://irep.iium.edu.my/52191/15/52191_A%20novel%20Clustering%20based%20Genetic_SCOPUS.pdf |
| Summary: | Genetic Algorithm (GA), a random universal evolutionary search technique that imitates the principle of biological evolution has been applied in solving various problems in different fields of human endeavor. Despite it strength and wide range of applications, optimal solution may not be feasible in situations where reproduction processes which involve chromosomes selection for mating and regeneration are not properly done. In addition, difficulty is often encountered when there are significant differences in the fitness values of chromosomes while using probabilistic based selection approach. In this work, clustering based GA with polygamy and dynamic population control mechanism have been proposed. Fitness value obtained from chromosomes in each generation were clustered into two-non-overlapping clusters. The surviving chromosomes in the selected cluster were subjected to polygamy crossover mating process while the population of the offsprings which would form the next generation were subjected to dynamic population control mechanisms. The process was repeated until convergence to global solution was achieved or number of generation elapsed. The proposed algorithm has been applied to route optimization problem. Results obtained showed that the proposed algorithm outperforms some of the existing techniques. Furthermore, the proposed algorithm converged to global solution within few iterations (generations) thus favoring its acceptability for online-realtime applications. It was also observed that the introduction of clustering based selection algorithm guaranteed the selection of cluster with the optimal solution in every generation. In addition, the introduction of dynamic population control with polygamy selection processes enabled fast convergence to optimal solution and diversity in the population respectively. |
|---|