Guys
Say, I have 100 objects with a very optimized permutation configuration. And I want to use Evolution algorithm to reach the configuration. I can think about which is to have a chromosome represent a random permutation of the 100 objects, and by some techniques I can evaluate fitness of the random permutation.
The problem is, to do the standard mutation and recombination on a population of random permutation configurations. Once I mutated one chromosome, or recombined between 2 chromosomes, there will be a chance that repeating objects would exist inside resulting permutations on different positions of that chromosomes.
Permutation should not have repeats. This is how the n! of permutation configurations to be calculated.
On next step, I will try to eliminate permutations which have repeats after mutation or recombination. But I'm really looking for a chromosome encoding won't produce repeats when it is mutated or recombined.
Thanks guys.
In reply to How to evolve a permutation? by zli034
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |