Abstract
Linear Linkage Encoding (LLE) is a recently proposed representation scheme for evolutionary algorithms. This representation has been used only in data clustering. However, it is also suitable for grouping problems. In this paper, we investigate LLE on two grouping problems; graph coloring and exam timetabling. Two crossover operators suitable for LLE are proposed and compared to the existing ones. Initial results show that LLE is a viable candidate for grouping problems whenever appropriate genetic operators are used. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Ülker, Ö., Özcan, E., & Korkmaz, E. E. (2006). Linear linkage encoding in grouping problems: applications on graph coloring and timetabling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3867 LNCS, pp. 347–363). Springer Verlag. https://doi.org/10.1007/978-3-540-77345-0_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
