Linear linkage encoding in genetic algorithms
Is this your thesis?
This record came from a bulk archive import. If it’s yours, link it to your profile.
Abstract (EN)
Linear Linkage Encoding (LLE) is a recently proposed representation scheme forevolutionary algorithms (EA). This representation has been previously used to solve dataclustering problem. It is also suitable for other grouping problems. In this thesis, this newencoding scheme is investigated on two other grouping problems; graph coloring and binpacking. The main focus of this work is to investigate genetic operators suitable for LLE.Performance enhancing crossover operators for graph coloring problem based on LLE areproposed and compared to the existing ones. Traditional crossover operators with additionalplacement heuristics are tested on bin packing problem. Initial results show that LinearLinkage Encoding is a viable candidate for grouping problems whenever appropriate geneticoperators are chosen.
Author
Özgür Ülker
How to Cite
Özgür Ülker (Master Thesis). Linear linkage encoding in genetic algorithms, 2006, Yeditepe University.
Keywords
License
Tüm Hakları Saklıdır
This work is shared under the specified license terms.
More theses from Yeditepe University
- Studies on cyclodextrin complexation of a poorly water soluble anti-hyperlipidemic drug, tablet formulation and characterization(2021)
- Washington ambassadors in Turkish-US relations (1927-1960)(2023)
- Metamorphosis of female voices: A study of the violation of women in Greek and Roman mythology and feminist rewritings reclaiming the narrative(2022)
- Knowledge distillation with foundation models for image segmentation(2023)
- The relationship between machiavelism, grandiose and vulnerable narcissism, and loneliness among white collar workers(2023)
- Evaluation of drug-drug interaction checkers along clinically relevant adverse drug events in oncology and hematology pediatric patients(2023)