logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Multi-objective Genetic Algorithms for grouping problems

delete2008-12-31
delete21
PRE
AI
E
Emin Erkan Korkmaz *
DOI：10.1007/s10489-008-0158-3delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Linear Linkage Encoding (LLE) is a convenient representational scheme for Genetic Algorithms (GAs). LLE can be used when a GA is applied to a grouping problem and this representation does not suffer from the redundancy problem that exists in classical encoding schemes. LLE has been mainly used in data clustering. One-point crossover has been utilized in these applications. In fact, the standard recombination operators are not suitable to be used with LLE. These operators can easily disturb the building blocks and cannot fully exploit the power of the representation. In this study, a new crossover operator is introduced for LLE. The operator which is named as group-crossover is tested on the data clustering problem and a very significant performance increase is obtained compared to classical one-point and uniform crossover operations. Graph coloring is the second domain where the proposed framework is tested. This is a challenging combinatorial optimization problem for search methods and no significant success has been obtained on the problem with pure GA. The experimental results denote that GAs powered with LLE can provide satisfactory outcomes in this domain, too.
Keywords:
Multi-objective Genetic Algorithms (MOGA)
Data clustering
Graph coloring
Linear Linkage Encoding (LLE)

Journal

Applied Intelligence cover
Applied Intelligence
IF:
3.5
Papers:
7.5K
Citations:
1.7W

Organization

No organization information available