This is a solution for the traveling salesman problem using the Python SimpleAI framework. This solution uses state space search with the local search hill climbing algorithm to find an optimal path given a set number of restarts.
Hunga1/SimpleAI-Traveling-Salesman-Problem
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
State Space Search with Hill Climbing Algorithm solution for the Traveling Salesman Problem using Python and the SimpleAI framework.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published