Saturday, December 5, 2009

Encoding Problem into Genetic Algorithm process

When dealing with Genetic Algorithm optimization method, there is need to encode problem that can be suite in Genetic Algorithm process.
In last article I have mention some about few ways to encode problem. Now I just want to explain more about one of the method that what I be use which is Permutation Encoding.
Permutation encoding can be used in ordering problems, such as traveling salesman problem or task ordering problem. In permutation encoding, every chromosome is a string of numbers, which represents number in a sequence.
In my research I use permutation where it can give order chosen node to be sleep mode, than monitor the delay on network as it fitness. Time slot of node to be sleep mode will be change for each chromosome population if packet delay of network increase. The process will be repeated until one solution have been found.
  • Crossover
Single point crossover - one crossover point is selected, till this point the permutation is copied from the first parent, then the second parent is scanned and if the number is not yet in the offspring it is added
(1 2 3 4 5 6 7 8 9) Chromosome A +
(4 5 3 6 8 9 7 2 1) Chromosome B
=> (1 2 3 4 5 6 8 9 7) After crossover
  • Mutation
Order changing - two numbers are selected and exchanged
(1 2 3 4 5 6 8 9 7) => (1 8 3 4 5 6 2 9 7)


I thank you for this useful and complete post, I was looking for post like this. I like your blog.
changing static ip address

Welcome anything that I can help you ...

Post a Comment

Newer Post Older Post Home


blogger templates | Make Money Online