Skip to content

Implementation of Travelling Salesman Problem using Held Karp Algorithm

License

Notifications You must be signed in to change notification settings

rastdeepanshu/DeliveryPlanner

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Delivery Planner

A service which can be used to determine the delivery/destination order of a vehicle/person.
The service uses Dynamic programming to implement the solution to the Travelling Salesman Problem (TSP).

Actual latitude and longitude can be given as inputs. The service uses Google's distance matrix API to calculate the road distance between the points given. The service doesn't takes into consideration the traffic situation

Algorithm

The Algorithm used is Held–Karp algorithm

Run

mvn spring-boot:run

Swagger can be accessed at: {host}/swagger-ui.html

About

Implementation of Travelling Salesman Problem using Held Karp Algorithm

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages