Our take on the classic Traveling Salesman Problem with some built in genetic algorithm which solves the randomly generated maps. There are a number of cities in each map, find the shortest route that allows the salesman to visit ALL cities and finally return to the city the salesman started in.
コメント