TSP SEMARANG MARKETS ROUTE USING DFS ALGORITHM
Daftar Isi:
- Travelling Salesman Problem [TSP] is one of the most intensively studied problems in computational mathematics. A salesman spends his time visiting nlocation from the starting point to the destination point. In one tour, salesman must visit each point just once and finish in destination point with lowest mileage possible to save the cost and energy This Project will create TSP software to help the salesman. The software is using Tree as data structures. Tree is needed to store the data used in this project. The data contain detail such as marketplace name and distance to reach another marketplace. DFS is used as algorithm. The concept of DFS is simple. The searching progress will start from the left child first until hit the bottom of the tree. When the progress hit the bottom tree, it will bounce up one level to search to the right node. If the searching progress go up one level but cannot find any other branch, then it will bounce up one more level or more until find another branch to be explored and so the rest. This software is work quite well. All the possible routes can be displayed in the GUI and there’s a notification on the shortest route. Also, user have the ability to update the markets data from the GUI.