ScratchData LogoScratchData
Back to _paperN1's profile

Genetic Algorithm on Traveling Salesman

_P_paperN1•Created January 30, 2017
Genetic Algorithm on Traveling Salesman
39
28
848 views
View on Scratch

Instructions

Press space for a new set of points. Press g to run the genetic algorithm again. Press p to pause and unpause the algorithm. Given an arbitrary set of points, the Traveling Salesman Problem asks for the shortest path that passes through all points, in straight lines. Points are sometimes also called cities. Here, a genetic algorithm finds a better and better path through all points.

Description

Inspired by the Traveling Salesman and genetic algorithms.

Project Details

Project ID142633771
CreatedJanuary 30, 2017
Last ModifiedFebruary 3, 2017
SharedFebruary 1, 2017
Visibilityvisible
CommentsAllowed