Real-time application of travelling salesman problem using Google Maps API

The Travelling Salesman Problem is defined as returning to the starting point after visiting all the points with the least cost. In this study, a real-world application that calculates the route of the Travelling Salesman Problem using the current traffic intensity information from Google Maps is prepared. Different methods such as Exhaustive Search, Heuristic A-Star Search, BitMask Dynamic Programming, Branch-and-Bound Algorithm and Greedy Search have been used in developing the desktop application. All these methods but Greedy Search have given the same routes. A user-friendly interface, displaying the shortest route in distance or duration on Google Maps, has been developed by adding different features.