JeffreyChow19 / tsp-with-dp

Solving Travelling Salesman Problem using Dynamic Programming

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

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

About

Solving Travelling Salesman Problem using Dynamic Programming


Languages

Language:Python 100.0%