13 genetic algorithms_9

By careful inspection of all strings from second or

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: n of all strings from second or third generation one may conclude that using crossover, where strings are always split into half, the best solution 110100 -> 52 will never be reached no matter how many generations are created. The genetic algorithm is very rapid and it leads to a good solution within a few generations. This solution is usually close to global maximum, but not the best. 10 Genetic Algorithms 11 Genetic Algorithms 10 11 Genetic Algorithms 12 13 14 12...
View Full Document

This note was uploaded on 01/29/2014 for the course ELEC 6240 taught by Professor Staff during the Winter '08 term at Auburn University.

Ask a homework question - tutors are online