UmbertoJr/ML-Constructive
ML-Constructive is a deep learning based constructive heuristic for the Traveling Salesman Problem.
This project offers a new way to solve complex Traveling Salesman Problem (TSP) challenges. It takes historical optimal TSP tours as input, learns patterns using machine learning, and then generates highly efficient new TSP solutions. This is for operations researchers, logistics planners, or anyone who needs to find optimal routes for a large number of stops.
No commits in the last 6 months.
Use this if you need to quickly find near-optimal routes for large-scale Traveling Salesman Problems and have access to past optimal tour data for training.
Not ideal if you're looking for a simple, off-the-shelf TSP solver without machine learning integration or if you lack historical optimal tour data for training.
Stars
11
Forks
3
Language
Python
License
MIT
Category
Last pushed
Feb 10, 2024
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/UmbertoJr/ML-Constructive"
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...