https://github.com/w1am/travellingsalesmanproblem
The travelling salesman problem is to go to each city exactly once and return to the start. Solving the problem should give a path and the length of the path. There are optimal solutions, that is solutions with the shortest path.
https://github.com/w1am/travellingsalesmanproblem
genetic-algorithm tsp-problem
Last synced: 11 months ago
JSON representation
The travelling salesman problem is to go to each city exactly once and return to the start. Solving the problem should give a path and the length of the path. There are optimal solutions, that is solutions with the shortest path.
- Host: GitHub
- URL: https://github.com/w1am/travellingsalesmanproblem
- Owner: w1am
- Created: 2022-11-13T12:57:13.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2022-11-16T12:20:33.000Z (over 3 years ago)
- Last Synced: 2023-03-07T18:23:58.627Z (over 3 years ago)
- Topics: genetic-algorithm, tsp-problem
- Language: Java
- Homepage:
- Size: 34.2 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0