Skip to Main Content
In Traveling Salesman Problems, there are n! possible routes for a tourist to visit n cities, by only passing through each city once before finally returning to the city of departure. The difficulty of this problem is in finding the shortest from among these n! possible routes quickly and effectively. This research integrates the Hungarian Method and Genetic Algorithm to find the shortest distance route and the distance or the approximately shortest distance route and the distance, and constructs the shortest distance route system for traveling. The system needs only a personal computer to find the shortest distance route and its corresponding distance quickly and effectively.