yining043/TSP-improve
An improvement-based Deep Reinforcement Learning Algorithm presented in paper https://arxiv.org/abs/1912.05784v2 for solving the TSP problem.
This project helps optimize routes for tasks like delivery schedules or logistics planning. You provide a list of locations, and it outputs an optimized sequence to visit them, minimizing travel distance or time. This is for operations managers, logistics planners, or anyone needing to find the most efficient path between multiple points.
101 stars. No commits in the last 6 months.
Use this if you need to find highly efficient routes for a fixed set of locations, like planning a courier's daily stops or optimizing a service technician's itinerary.
Not ideal if your routing problems involve dynamic changes, complex constraints like vehicle capacity, time windows, or pickup and delivery tasks, as more advanced tools might be better suited.
Stars
101
Forks
30
Language
Jupyter Notebook
License
MIT
Category
Last pushed
Nov 07, 2022
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/yining043/TSP-improve"
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
albert-espin/knapsack-packing
Evolutionary Algorithm for the 2D Packing Problem combined with the 0/1 Knapsack Problem (Master Thesis)
ashishpatel26/Amazing-Collection-Vehicle-Routing-Problem
Amazing Collection Vehicle Routing Problem
rithinch/pareto-optimal-student-supervisor-allocation
🎓An AI tool to assist universities with optimal allocation of students to supervisors for their...