Evolutionary systems & genetic algorithms

From GenerativeArt

(Difference between revisions)
Jump to: navigation, search
(fix image urls)
(Example of Classic Genetic Programming for Problem Solving - Lawrence Fogel: removed TSP example)
  010<font color="red">0</font>      XOR      011<font color="red">1</font>
  010<font color="red">0</font>      XOR      011<font color="red">1</font>
-
 
-
== Example of Classic Genetic Programming for Problem Solving - Lawrence Fogel ==
 
-
 
-
Fogel is a graduate of NYU (B.S.E.E. 1948) and began the field of genetic programming in the mid-1960's. Genetic programming was used as a way to optimize solutions to problems with no exact or analytic solution.
 
-
 
-
 
-
<span style="font-size:larger;">The Traveling Salesman problem</span>
 
-
 
-
The goal of this classic optimization problem is to craft a path visiting each location once and only once in the shortest distance possible.
 
-
 
-
 
-
{{SingleImage|imageWidthPlusTen=592|imageURL=http://www.viz.tamu.edu/courses/viza658/wiki/genetic/07.png|caption=Traveling Salesman Problem}}
 
-
 
-
 
-
{{SingleImage|imageWidthPlusTen=729|imageURL=http://www.viz.tamu.edu/courses/viza658/wiki/genetic/08.jpg|caption=Routing Problems}}
 
-
 
-
 
-
{{SingleImage|imageWidthPlusTen=740|imageURL=http://www.viz.tamu.edu/courses/viza658/wiki/genetic/09.jpg|caption=Traveling Salesman Problem Visualized}}
 
-
 
-
 
-
{{SingleImage|imageWidthPlusTen=766|imageURL=http://www.viz.tamu.edu/courses/viza658/wiki/genetic/10.jpg|caption=Traveling Salesman Problem Visualized}}
 

Revision as of 20:14, 9 September 2013

Personal tools