https://github.com/underyourspell/tspgo
Heuristic methods for solving the Traveling Salesman Problem in Go.
https://github.com/underyourspell/tspgo
christofides-algorithm genetic-algorithm go golang linear-rank-selection minimum-spanning-tree nearest-neighbor roulette-wheel-algorithm single-point-crossover tsp tsplib-format
Last synced: 6 months ago
JSON representation
Heuristic methods for solving the Traveling Salesman Problem in Go.
- Host: GitHub
- URL: https://github.com/underyourspell/tspgo
- Owner: UnderYourSpell
- Created: 2024-12-19T20:13:56.000Z (10 months ago)
- Default Branch: master
- Last Pushed: 2025-01-07T18:21:47.000Z (9 months ago)
- Last Synced: 2025-02-14T19:51:55.338Z (8 months ago)
- Topics: christofides-algorithm, genetic-algorithm, go, golang, linear-rank-selection, minimum-spanning-tree, nearest-neighbor, roulette-wheel-algorithm, single-point-crossover, tsp, tsplib-format
- Language: Go
- Homepage:
- Size: 272 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# The Traveling Salesman Problem Go Implementation
In my undergrad, I did research pertaining to algorithms that solve the NP-Complete Traveling Salesman Problem (TSP). In a class for AI, I wrote an implementation of the Genetic Algorithm that solves the TSP in C++.
I enjoyed writing it so I wanted to explore the problem further. I also wanted to learn Go as it seemed like an interesting programming language.
This Go implementation builds on my C++ implementation and I hope to explore this problem and the algorithms that solve it by using the Go language.
### Genetic Algorithm
The Genetic Algorithm implenetation is complete. Paramaters are adjustable in main.go.
### Christofides
Christofides Heauristic mostly done.
Simulated Annealing with 2opt swap will be next addition