encode-attend-navigate-pytorch
som-tsp
| encode-attend-navigate-pytorch | som-tsp | |
|---|---|---|
| 4 | 11 | |
| 7 | 3,615 | |
| - | - | |
| 0.0 | 0.0 | |
| 10 months ago | 4 months ago | |
| Python | Python | |
| - | MIT License |
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.
encode-attend-navigate-pytorch
-
[Pytorch reimplementation] Encode-Attend-Navigate, a RL-based TSP solver;
https://github.com/astariul/encode-attend-navigate-pytorch I recently re-implemented encode-attend-navigate, a TSP solver based on RL. The official repo was using tensorflow 1.x, so I decided tore-implement it at Pytorch. I wanted to share it here to get some opinion :) You can train the model using a free GPU from Google Colab, a Colab notebook is provided in the README !
- [P] Pytorch reimplementation of Encode-Attend-Navigate, a RL-based TSP solver
-
[P] Reinforcement Learning with multiple simultaneous actions?
Pytorch : encode-attend-navigate-pytorch
- [Pytorch reimplementation] Encode-Attend-Navigate, a RL-based TSP solver
som-tsp
- 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?
encode-attend-navigate - Learning Heuristics for the TSP by Policy Gradient
minisom - :red_circle: MiniSom is a minimalistic implementation of the Self Organizing Maps
HybridTSPSolver - A hybrid TSP solver that I made for my master's degree thesis in computer science.
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)
d2l-en - Interactive deep learning book with multi-framework code, math, and discussions. Adopted at 500 universities from 70 countries including Stanford, MIT, Harvard, and Cambridge.
TSP_Solver - Python code for visualizations of algorithms that provide approximate solutions to TSP along with two lower bound approximations
Neupy - NeuPy is a Tensorflow based python library for prototyping and building neural networks