In: Computer Science
The Traveling Salesman Problem was named after the job of a traveling salesman but finds many applications elsewhere. Research the traveling salesman and provide two examples of real-world applications. Make sure to explain how these applications are applied.
Answer:
The traveling salesman problem (TSP) is a problem combinatorial optimization and has several applications, such as vehicle routing problems, logistics, planning and scheduling. The main problem of the TSP is to find a tour of a given number (n) of cities with a minimum distance, where each city visited exactly once and returning to the starting city.
The real world examples for travelling sales man problem is google maps on android OS.The hybrid system is implemented to solve TSP to obtain the optimal route on Google Maps in Android OS. The hybrid system using Google Maps API Android for handles access to Google Maps servers, data downloading, map display, and response to map gestures.In the hybrid system function of Google Maps API is to obtain distance between cities and marker of the geographical location (latitude and longitude) on the map as a destination cities of the salesman. The destination cities should be set from database SQLite. Once, the city position is obtained and shown into Google maps android as a marker. Based on the TSP, distance between cities to be visited are gotten from Google Server are stored into the data set matrix.