The Approximate Shortest Distance Route Intelligent System For Traveling in Taiwan

In a well known problem, there are N! possible routes for tourists to visit N cities, with each city passed through once before the return to the departure city. It is difficult to find the shortest route among N! possible routes quickly and effectively. This research proposes a method that integrates the Hungarian Method and the Branch-and-Bound Method in Operation Research, Nearest Neighbor in Data Mining, and Rule Based Inference in Artificial Intelligence to find the approximately shortest distance route and the distance. It also uses object-oriented programming to construct the Approximate Shortest Distance Route Intelligent System for Traveling (ASDRST). The ASDRST needs only a personal computer and it can find the approximate shortest distance route and corresponding distance quickly and effectively compared with other systems. Its accuracy is more than 99.8% in a pass-through of 42 cities.