A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
JARINGAN SARAF TIRUAN SEBAGAI ALTERNATIF UNTUK PENYELESAIAN TRAVELLING SALESPERSON PROBLEM
2001
Jurnal Informatika
Traveling Salesperson Problem (TSP) is one among the NP-complete problem. TSP is defined as follows. A traveling salesperson has a number of cities to visit. The sequence in which the salesperson visits diffrents cities is called a tour. A tour should be such that every city is visited once and only once. The goal is to find a tour that minimize the total distance of a tour. TSP can be solved by Exhaustive algorithm, but this algorithm is no efficient for large number of cities. A neural
doaj:102729b92e6a4972a2f593178322a688
fatcat:vbyojlayczcwvgpwsg7pne2c3m