encode-attend-navigate-pytorch
HybridTSPSolver
| encode-attend-navigate-pytorch | HybridTSPSolver | |
|---|---|---|
| 4 | 2 | |
| 7 | 10 | |
| - | - | |
| 0.0 | 10.0 | |
| 10 months ago | 3 months ago | |
| Python | C | |
| - | 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
HybridTSPSolver
- Feedback on a Hybrid TSP Solver
-
Hybrid TSP Solver
Hello everyone, this is my inaugural post in this community, and I'm excited to share with you my master's degree project. It's an hybrid TSP solver that blends the 1Tree branch-and-bound algorithm by Held and Karp with a Graph Convolutional Network. I've made the entire codebase available on this Github repository, along with detailed information of the ideas and the good results obtained. I'm posting this to receive feedback on my work, including your thoughts on potential areas for improvement and whether you believe some of these concepts could also be applied to Concorde.
What are some alternatives?
encode-attend-navigate - Learning Heuristics for the TSP by Policy Gradient
csips - A pure-python integer programming solver
VeRyPy - A python library with implementations of 15 classical heuristics for the capacitated vehicle routing problem.
igc-xc-score - A scoring program for gliding competitions striving for 100% accuracy and determinism
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.
diffnet - Graph Neural Network based Social Recommendation Model. SIGIR2019.
som-tsp - Solving the Traveling Salesman Problem using Self-Organizing Maps
darknet - YOLOv4 / Scaled-YOLOv4 / YOLO - Neural Networks for Object Detection (Windows and Linux version of Darknet )
OptaPlanner - Java Constraint Solver to solve vehicle routing, employee rostering, task assignment, maintenance scheduling, conference scheduling and other planning problems.