lukasz-iskierka/ai-tabu-search-and-genetic-algorithm-tsp
Implementation of single-solution (Tabu Search) vs population-based (Genetic Algorithm) approaches to the Traveling Salesman Problem. Features statistical analysis, and scalability testing across different problem sizes for both academic research and practical applications.
No commits in the last 6 months.
Stars
—
Forks
—
Language
Jupyter Notebook
License
MIT
Category
Last pushed
Jan 09, 2025
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/lukasz-iskierka/ai-tabu-search-and-genetic-algorithm-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...