13 genetic algorithms_9

500 00004 00016 4 100101 37 0925 00307 01197 5 001010

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1197 5 001010 10 0.250 0.0041 0.0158 6 110001 49 1.225 0.0743 0.2895 7 100111 39 0.975 0.0390 0.1521 8 000100 4 0.100 0.0016 0.0062 0.2568 1.0000 0.03 0.02 variable value 1.125 function value 0.0633 Selection and reproduction Selection of the best members of the population is an important step in the genetic algorithm. Many different approaches can be used to rank individuals. In our example the ranking function is given. Highest rank has member number 6 and lowest rank has member number 3. Members with higher rank should have higher chances to reproduce. The probability of reproduction for each member can be obtained as fraction of the...
View Full Document

Ask a homework question - tutors are online