TSP_Solver
Python code for visualizations of algorithms that provide approximate solutions to TSP along with two lower bound approximations (by chriski777)
som-tsp
Solving the Traveling Salesman Problem using Self-Organizing Maps (by diego-vicente)
| TSP_Solver | som-tsp | |
|---|---|---|
| 1 | 11 | |
| 8 | 3,615 | |
| - | - | |
| 0.0 | 0.0 | |
| over 2 years ago | 5 months ago | |
| Python | Python | |
| MIT License | MIT License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
TSP_Solver
Posts with mentions or reviews of TSP_Solver.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-03-28.
-
Bad Apple!! but it's all slider anchors
The program was made in Python with the networkx library and TSP solving code from this open source project.
som-tsp
Posts with mentions or reviews of som-tsp.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-10-17.
- Using Self-Organizing Maps to solve the Traveling Salesman Problem
-
Self-Organizing Maps can be used to to solve the Traveling Salesman Problem — The Traveling Salesman Problem is a well known challenge in Computer Science: it consists on finding the shortest route possible that traverses all cities in a given map only once.
Blog: https://diego.codes/post/som-tsp/
- Using Self-Organizing Maps to Solve the Traveling Salesman Problem
-
Ok, who's got an implementation ready - QGIS plugin, Arc toolbox/script, Post, whatever?
The blog link about it in that comment: https://diego.codes/post/som-tsp/
-
Solving the travelling salesman problem using Self-Organizing Maps
Read more on the technique and implementation of self organizing maps in this blog post
-
Solving the travelling salesman problem using self-organising maps
Github repo
- Som-Tsp - Solving the traveling salesman problem using self-organizing maps
- Som-Tsp – Solving the traveling salesman problem using self-organizing maps
What are some alternatives?
When comparing TSP_Solver and som-tsp you can also consider the following projects:
retomaton - PyTorch code for the RetoMaton paper: "Neuro-Symbolic Language Modeling with Automaton-augmented Retrieval" (ICML 2022)
minisom - :red_circle: MiniSom is a minimalistic implementation of the Self Organizing Maps
VeRyPy - A python library with implementations of 15 classical heuristics for the capacitated vehicle routing problem.
susi - SuSi: Python package for unsupervised, supervised and semi-supervised self-organizing maps (SOM)
Neupy - NeuPy is a Tensorflow based python library for prototyping and building neural networks
encode-attend-navigate-pytorch - Encode-attend-navigate unofficial Pytorch implementation