Chromosome Reuse in genetic algorithms

17Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper introduces a novel genetic algorithm strategy based on the reuse of chromosomes from previous generations in the creation of offspring individuals. A number of chromosomes of above-average quality, that are not utilized for recombination in the current generation, are inserted into a library called the chromosome library. The main motivation behind the chromosome reuse strategy is to trace some of the untested search directions in the recombination of potentially promising solutions. In the recombination process, chromosomes of current population are combined with the ones in the chromosome library to form a population from which offspring individuals are to be created. Chromosome library is partially updated at the end of each generation and its size is limited by a maximum value. The proposed algorithm is applied to the solution of hard numerical and combinatorial optimization problems. It outperforms the conventional genetic algorithms in all trials. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Acan, A., & Tekol, Y. (2003). Chromosome Reuse in genetic algorithms. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2723, 695–705. https://doi.org/10.1007/3-540-45105-6_85

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free