39
edits
Changes
Jump to navigation
Jump to search
Line 27:
Line 27: − − * Goldberg, D. E. Genetic Algorithms in Search Optimization & Machine Learning. Addison-Wesley, New York, 1989. + +
Travelling Salesman Problem (view source)
Revision as of 14:37, February 20, 2008
, 14:37, February 20, 2008→Example letting simulated evolution find a good solution
In a special case when all towns are equidistantly placed along a circle, the optimal solution is found when all loops have been removed. This means that this simple random search is able to find one optimal tour out of as many as 10^80. This random process is also similar to evolution in the sense that it uses random variation and selection in cyclic repetition. This also means that the cyclic repetition of random variation and selection of individuals is a very important principle for creating a huge amount of [[information]]. See Goldberg, 1989.
In a special case when all towns are equidistantly placed along a circle, the optimal solution is found when all loops have been removed. This means that this simple random search is able to find one optimal tour out of as many as 10^80. This random process is also similar to evolution in the sense that it uses random variation and selection in cyclic repetition. This also means that the cyclic repetition of random variation and selection of individuals is a very important principle for creating a huge amount of [[information]]. See Goldberg, 1989.
== References ==
* Goldberg, D. E. Genetic Algorithms in Search Optimization & Machine Learning. Addison-Wesley, New York, 1989.
[[Category:Mathematics]]
[[Category:Mathematics]]