Content deleted Content added
removed explanation of genetic algorithm, added discussion on chromosome design |
m linked genetic operator |
||
Line 8:
A more realistic problem we might wish to solve is the [[travelling salesman problem]]. In this problem, we seek an ordered list of cities that results in the shortest trip for the salesman to travel. Suppose there are six cities, which we'll call A, B, C, D, E, and F. A good design for our chromosome might be the ordered list we want to try. An example chromosome we might encounter in the population might be <code>DFABEC</code>.
The [[mutation (genetic algorithm)|mutation]] [[genetic operator|operator]] and [[crossover (genetic algorithm)|crossover]] operator employed by the genetic algorithm must take into account the chromosome's design.
[[Category:Genetic algorithms]]
| |||