TSP/en
Zur Navigation springen
Zur Suche springen
 Traveling Salesman Problem An easier question to answer is what the TSP project does. For the alpha stage it is in now, the TSP uses a genetic algorithm to find a solution to a 48 city traveling salesman problem. I picked the 48 USA state capitals as I found a databa set online that I could adapt to the project easily. Once the bugs are worked out, it will be time for more serious endeavours. One stage will be to find the real solution exhaustively. After that the testing of various genetic algorithms, or other types of search algorithms will begin. For some reason I just find search algorithms interesting. |
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
