Spider-scnu / Monte-Carlo-tree-search-for-TSP
This is the source code for solving the Traveling Salesman Problems (TSP) using Monte Carlo tree search (MCTS).
☆29Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for Monte-Carlo-tree-search-for-TSP
- Code accompanying the paper Graph Neural Network Guided Local Search for the Traveling Salesperson Problem☆25Updated last year
- Code for the paper 'On Learning Paradigms for the Travelling Salesman Problem' (NeurIPS 2019 Graph Representation Learning Workshop)☆32Updated 3 years ago
- ☆121Updated 2 years ago
- Learning 2-opt Heuristics for the TSP via Deep Reinforcement Learning☆45Updated 4 years ago
- Hierarchical deep reinforcement learning for combinatorial optimization problem☆34Updated 5 years ago
- [ICML 2023] "Towards Omni-generalizable Neural Methods for Vehicle Routing Problems"☆41Updated last year
- Learning a Latent Search Space for Routing Problems using Variational Autoencoders☆25Updated 3 years ago
- Efficient Active Search☆47Updated 2 years ago
- ☆47Updated 2 years ago
- ☆20Updated 3 years ago
- ☆70Updated 2 years ago
- ☆30Updated 2 years ago
- ☆39Updated 5 months ago
- ☆16Updated 6 years ago
- ☆15Updated last month
- ☆40Updated 2 years ago
- Official implementation of H-TSP (AAAI2023)☆41Updated 5 months ago
- ☆22Updated 9 months ago
- ☆48Updated 3 years ago
- ☆21Updated 3 years ago
- ☆19Updated 2 years ago
- Learning to Compare Nodes in Branch and Bound with Graph Neural Networks (NeurIPS 2022)☆19Updated 2 years ago
- ☆20Updated last year
- ☆34Updated last year
- Population-Based Reinforcement Learning for Combinatorial Optimization☆65Updated 9 months ago
- Co-training for Policy Learning☆13Updated 5 years ago
- ☆38Updated 3 weeks ago
- Reinforcement learning for operation research problems with OpenAI Gym and CleanRL☆85Updated last year
- COMPASS: Combinatorial Optimization with Policy Adaptation using Latent Space Search☆32Updated 5 months ago
- DPDP☆95Updated last year