Please use this identifier to cite or link to this item:
|Title:||Population diversity in permutation-based genetic algorithm|
|Authors:||Zhu, K.Q. |
|Citation:||Zhu, K.Q.,Liu, Z. (2004). Population diversity in permutation-based genetic algorithm. Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) 3201 : 537-547. ScholarBank@NUS Repository.|
|Abstract:||This paper presents an empirical study of population diversity measures and adaptive control of diversity in the context of a permutation-based algorithm for Traveling Salesman Problems and Vehicle Routing Problems. We provide detailed graphical observations and discussion of the relationship among the four diversity measures and suggest a moderate correlation between diversity and search performance under simple conditions. We also study the effects of adapting key genetic control parameters such as crossover and mutation rates on the population diversity. We are able to show that adaptive control of the genetic operations based on population diversity effectively outperforms fixed parameter genetic algorithms. © Springer-Verlag Berlin Heidelberg 2004.|
|Source Title:||Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 27, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.