GitHub / PARSA-MHMDI / AI-simulated-annealing-algorithm-TSP
Using Simulated Annealing (SA) algorithm to improve an initial solution from Nearest Neighbor Search (NNS) for Travelling Salesman Problem (TSP).
Stars: 1
Forks: 0
Open issues: 0
License: None
Language: Jupyter Notebook
Size: 436 KB
Dependencies parsed at: Pending
Created at: almost 3 years ago
Updated at: over 2 years ago
Pushed at: almost 3 years ago
Last synced at: about 2 years ago
Topics: ai, artificial-intelligence, sa, simulated-annealing, simulated-annealing-algorithm, travelling-salesman-problem, tsp, tsp-problem