sleepymalc/Travel-the-Same-Path
Travel the Same Path: A TSP Solving Strategy.
This project offers a novel way to solve the Traveling Salesperson Problem (TSP), a classic challenge in optimization. It takes in various TSP problem setups and generates training data to learn efficient solutions. This is intended for researchers or practitioners who need to find optimal routes for a moderate number of locations and are exploring advanced machine learning techniques for combinatorial optimization.
No commits in the last 6 months.
Use this if you are a researcher or advanced practitioner investigating new methods for solving the Traveling Salesperson Problem, particularly using imitation learning and graph neural networks, and need to generate datasets and train models for small to medium-sized problems.
Not ideal if you need an out-of-the-box solution for large-scale production routing or if you are not comfortable with command-line operations and setting up machine learning experiments.
Stars
7
Forks
1
Language
—
License
MIT
Category
Last pushed
Oct 22, 2022
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/sleepymalc/Travel-the-Same-Path"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
pdrm83/py2opt
How to solve the traveling salesman problem with the 2-opt algorithm, a fast heuristic search algorithm.
aimclub/SAMPO
Open-source framework for adaptive manufacturing processes scheduling
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...