APLIKASI JARINGAN HOPFIELD PADA TRAVELLING SALESMAN PROBLEM (TSP) (Application Hopfield Neural Network Of Travelling Salesman Problem)

Abstract

Traveling Salesman Problem (TSP) is the travel problem a salesman who must visit n the point where a salesman must visit every dot exactly once and must eventually be returned to the starting point. In addition salesman must also minimize the total travel distance. TSP is a problem that can be solved by various algorithms. One is the Hopfield algorithm, or better known as the Hopfield Neural Network. This study aims to obtain completion of the TSP by using the Hopfield Neural Network and create a program to solve the problem. The result is the route so that the total travel distance is minimal. The results obtained from the program that was created with Matlab 7.8 software to solve TSP by Hopfield Neural Network. The program can be used for different data on all TSP problems. Input from this program are many cit ies, the distance matrix, the parameters α, β, and λ. While the output of the program in the form of an optimal route, the length of optimal route, optimal route and the number of image iteration.