OPTIMASI RUTE TRAVELLING SALESMAN PROBLEM DENGAN ALGORITMA A* (A-STAR) (Travelling Salesman Problem Route Optimization With A* (A-Star) Algorithm)

Abstract

Traveling Salesman Problem (TSP) is generally described as a case of a sales trip that depart from the city of origin to visit every city exactly once and return to the city of origin. One algorithm that can be used to solve TSP is A * (A-Star) algorithm. The purpose of this article to apply the A* algorithm in the TSP and make the program A* algorithm to solve TSP with Visual Basic 6.0. The article method begins by identifying the points and sides then represented in a weighted graph, then make programming algorithm of TSP with the A* algorithm and create a program based on the programming algorithm to find the shortest TSP. The results showed that the A* algorithm can be used to solve TSP so can get a route with minimal total distance.