The program solves the traveling salesman problem. The program accepts data in xml format (example 5 data files added) or txt file. The program allows you to choose the algorithm that solves the traveling salesman problem. The program has five algorithms implemented:
Brute force search algorithm
Branch-and-Bound algorithm
Tabu Search algorithm
Greedy algorithm
Genetic algorithm
As a result, the program returns the shortest found path and the cost of passing this path.
-
Notifications
You must be signed in to change notification settings - Fork 0
mattho1/TSP-solving-algorithms
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