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).
☆32Updated 5 years ago
Alternatives and similar repositories for Monte-Carlo-tree-search-for-TSP:
Users that are interested in Monte-Carlo-tree-search-for-TSP are comparing it to the libraries listed below
- ☆131Updated 2 years ago
- Code for the paper 'On Learning Paradigms for the Travelling Salesman Problem' (NeurIPS 2019 Graph Representation Learning Workshop)☆33Updated 4 years ago
- ☆74Updated 2 years ago
- Learning 2-opt Heuristics for the TSP via Deep Reinforcement Learning☆51Updated 4 years ago
- Efficient Active Search☆49Updated 3 years ago
- Learning a Latent Search Space for Routing Problems using Variational Autoencoders☆26Updated 3 years ago
- ☆39Updated last year
- Code accompanying the paper Graph Neural Network Guided Local Search for the Traveling Salesperson Problem☆26Updated 2 years ago
- [ICML 2023] "Towards Omni-generalizable Neural Methods for Vehicle Routing Problems"☆49Updated last year
- ☆20Updated 3 years ago
- Hierarchical deep reinforcement learning for combinatorial optimization problem☆35Updated 5 years ago
- ☆45Updated 3 years ago
- Official implementation of H-TSP (AAAI2023)☆47Updated 3 weeks ago
- ☆42Updated 2 months ago
- ☆23Updated last year
- ☆51Updated 3 years ago
- ☆53Updated 2 years ago
- DPDP☆100Updated 2 years ago
- Reinforcement learning for operation research problems with OpenAI Gym and CleanRL☆98Updated 2 years ago
- [ICML'24 FM-Wild Oral] RouteFinder: Towards Foundation Models for Vehicle Routing Problems☆65Updated 2 weeks ago
- ☆18Updated 6 months ago
- ☆21Updated 3 years ago
- Algorithms for the Orienteering Problem☆36Updated 2 months ago
- ☆21Updated 2 years ago
- ☆107Updated 4 years ago
- This repo implements our paper, "Learning to Search Feasible and Infeasible Regions of Routing Problems with Flexible Neural k-Opt", whic…☆46Updated 8 months ago
- Learning to Compare Nodes in Branch and Bound with Graph Neural Networks (NeurIPS 2022)☆21Updated 2 years ago
- Official repository for the TMLR paper "Self-Improvement for Neural Combinatorial Optimization: Sample Without Replacement, but Improveme…☆25Updated 3 weeks ago
- ☆26Updated 3 years ago
- ☆39Updated 3 weeks ago