Skip to content

Solving Travelling Salesman Problem using Dynamic Programming

Notifications You must be signed in to change notification settings

JeffreyChow19/tsp-with-dp

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Travelling Salesman Problem using Dynamic Programming

This program solves travelling salesman problem using dynamic programming to optimize the best route finding to experience all the Universal Studio Singapore's Characted Meet and Greet Events.

About the Programs

coordinate-extractor.py is a program to extract coordinate position of a location on an image map (uss-map.jpg). dp.py is the main program uss.json is the file to store location information by using JSON.

How to Run

On the terminal of the root directory

py dp.py

Results

Dynamic Programming

image

Brute Force

image

Conclusion

Dynamic Programming is faster than Brute Force in solving Travelling Salesman Problem

Releases

No releases published

Packages

No packages published

Languages