Group project for CS441(AI) Genetic algorithm written to solve the traveling salesman problem Given 9 cities and the distances between each city in a matrix Pop size set to 1000 Generations set to 30 Mutation swaps 2 random places of cities in a child Written in c++
-
Notifications
You must be signed in to change notification settings - Fork 0
valfaro123/CPP-TSP
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published