A method for chromosome handling of r-permutations of n-element set in genetic algorithms
Göktürk Üçoluk · 2002
Combinatorial optimisation problems are in the domain of Genetic Algorithms (GA) interest. Unfortunately ordinary crossover and mutation operators cause problems for chromosome representations of permutations and some types of combinations. This is so because offsprings generated by means of the ordinary operators are of a great possibility no more valid chromosomes. A variety of methods and new operators that handle that sort of obscenities are introduced throughout the literature. A new method for representing r-permutations of n-elements as GA chromosomes has been introduced. In contrast to the conventional ones this proposed representation is not handicapped under crossover and mutation. The proposed method is used in various scheduling and timetabling GA applications problems and is observed to perform extremely well.