Linear linkage encoding in grouping problems: applications on graph coloring and timetabling

  • Authors:
  • Özgür Ülker;Ender Özcan;Emin Erkan Korkmaz

  • Affiliations:
  • Department of Computer Engineering, Yeditepe University, Istanbul, Turkey;Department of Computer Engineering, Yeditepe University, Istanbul, Turkey;Department of Computer Engineering, Yeditepe University, Istanbul, Turkey

  • Venue:
  • PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
  • Year:
  • 2006

Quantified Score

Hi-index 0.02

Visualization

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.