Скачать или смотреть AI using Genetic Algorithm to find the shortest way through all capitals in Europe | TSP

I've taught myself an Artificial Intelligence (AI) field called Genetic Algorithms, which mimics evolution to solve problems. One the problems Genetic Algorithms can solve is the notorious Traveling Salesman Problem (TSP).

The idea behind the TSP is that you want to visit a number locations but you can only visit each location once. The more locations you have the more difficult it becomes to solve the problem. For example to visit all 45 European capitals (excluding Moscow because no one wants to visit Russia again) you would have to try 45! = 1.1962222e+56 combinations.

A Genetic Algorithm (https://en.wikipedia.org/wiki/Genetic..., as can be seen in the video, can find a short path in a few minutes. We don't know if this is the shortest path - but it is a short path which is usually good enough! The GA parameters I used to solve the problem are:
Population size: 500
Mutation rate: 20% (the remaining 80% are from crossover)
Elitism: 20% (of the solutions from last generation ends up in the next generation)

I made this visualization in Unity using C# programming language. It is not open source yet but may be so in the future.

Follow me on Twitter:   / eriknordeus  

#madewithunity #geneticalgorithm #artificialintelligence #travelingsalesmanproblem #tsp #unity3d