Skip to content

Solving TSP problem using A star, RBFS, and Hill-climbing algorithms

License

Notifications You must be signed in to change notification settings

Altaheri/TSP-Travelling-Salesman-Problem

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

TSP-Travelling-Salesman-Problem

Solving Travelling Salesman Problem (TSP) using A* (star), Recursive Best First Search (RBFS), and Hill-climbing Search algorithms

Author: Hamdi Altaheri, King Saud University, Saudi Arabia

For a discussion of the results, please refer to: https://sites.google.com/view/tsp-solve

About

Solving TSP problem using A star, RBFS, and Hill-climbing algorithms

Resources

License

Stars

Watchers

Forks

Packages

No packages published

Languages