pdrm83/py2opt
How to solve the traveling salesman problem with the 2-opt algorithm, a fast heuristic search algorithm.
This helps with logistical planning by finding the shortest possible route between multiple locations. You input a list of locations and the distances between each pair, and it outputs the most efficient order to visit them and the total distance. This is useful for anyone who needs to optimize travel paths, such as delivery managers, field service coordinators, or operations planners.
No commits in the last 6 months. Available on PyPI.
Use this if you need to quickly find a good, near-optimal solution for the shortest route visiting many points, even if a perfectly optimal solution isn't strictly necessary.
Not ideal if you absolutely require the guaranteed globally shortest route for a complex problem, as this algorithm provides fast, good solutions but not always the absolute best.
Stars
34
Forks
10
Language
Python
License
MIT
Category
Last pushed
Jan 17, 2023
Commits (30d)
0
Dependencies
3
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/pdrm83/py2opt"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Related frameworks
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...
Sinclert/Heuristics-TSP
Travelling Salesman Problem solution 🚚