From CSULA CS Wiki
< Courses‎ | CS 461‎ | Winter 2006‎ | Jesse Zwerling
Revision as of 15:19, 22 May 2006 by WikiAdmin (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Week 9 homework

tsp with ga using netlogo

nlogo file

implemented some interesting algorithms from this page

Genetic Algorithms and the Traveling Salesman Problem

In particular his approach to mutation (greedy swap) and his greedy crossover strategy.

used this as a starting point, not ga though

netlogo tsp