Assignment #1 TSP MECS 4510 Evolutionary Computation Hod Lipson TSP: Example 1 Path length = 25.19 Path length = 5.64 0 500 1000 1500 2000 4 6 8 10 12 14 16 18 20 22 24 RMHC GA SUS GA DC GA DC+R S h o rt e s t P a th GenerationsEvaluations x 100 TSP: Example 2 Path length = 3.14 Path length = 29.65 0 500 1000 1500 2000 0 5 10 15 20 25 30 TSP2 S h o rt e s t P a th Generations RMHC GA SUS GA DC GA DC+R Evaluations x 100 TSP: Example 3 Path length = 3.99 Path length = 29.73 0 500 1000 1500 2000 2 4 6 8 10 12 14 16 18 20 22 TSP3 RMHC GA SUS GA DC GA DC+R Y A x is T it le X Axis TitleEvaluations x 100 S h o rt e s t P a th Traveling Salesman Problem* *With Frequent-Flyer Benefits Path length = 36.97Path length = 25.19 Path Length 25.19 Path Length 36.97 Run 0 500 1000 1500 2000 2500 3000 4 5 6 7 8 9 10 11 12 13 Random Search GA (Roulette, Tight Linkage) Parallel Hillclimber Parallel Simulated Annealing GA (Diversity, Poor Linkage) GA (Diversity, Tight Linkage) B e s t F it n e s s GenerationEvaluations Performance plots Maxwell Segan 100x Maxwell Segan