arjun-krishna/TSP
Ant Colony Optimization and Simulated Annealing implemented in C++ for solving the Travelling Salesman Problem
This project helps optimize routes for deliveries, sales territories, or field service technicians. You provide a list of locations, and it calculates the shortest possible route that visits each location exactly once and returns to the origin. This is for anyone in logistics, operations, or planning who needs to find the most efficient sequence for multiple stops.
No commits in the last 6 months.
Use this if you have a set of locations and need to find the absolute shortest path to visit all of them.
Not ideal if your problem involves dynamic routing, real-time traffic, or multiple vehicles with complex constraints.
Stars
7
Forks
5
Language
C++
License
MIT
Category
Last pushed
Mar 19, 2021
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/arjun-krishna/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...