xyfffff/rethink_mcts_for_tsp
[ICML'24 Oral] Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems
This project helps optimize routes for very large-scale Traveling Salesman Problems (TSPs). It takes in a set of locations (cities) and outputs an optimized route, aiming for the shortest possible path. Supply chain managers, logistics planners, or anyone needing to optimize delivery or travel routes for hundreds or thousands of stops would find this useful.
No commits in the last 6 months.
Use this if you need to find highly efficient routes for complex Traveling Salesman Problems with many locations and are evaluating advanced computational methods.
Not ideal if you are looking for a simple, off-the-shelf route planning app for everyday use or if your routing problems involve very few stops.
Stars
41
Forks
5
Language
C
License
—
Category
Last pushed
Apr 06, 2025
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/xyfffff/rethink_mcts_for_tsp"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
aimclub/SAMPO
Open-source framework for adaptive manufacturing processes scheduling
pdrm83/py2opt
How to solve the traveling salesman problem with the 2-opt algorithm, a fast heuristic search algorithm.
yining043/TSP-improve
An improvement-based Deep Reinforcement Learning Algorithm presented in paper...
albert-espin/knapsack-packing
Evolutionary Algorithm for the 2D Packing Problem combined with the 0/1 Knapsack Problem (Master Thesis)
rithinch/pareto-optimal-student-supervisor-allocation
🎓An AI tool to assist universities with optimal allocation of students to supervisors for their...