JARINGAN SARAF TIRUAN SEBAGAI ALTERNATIF UNTUK PENYELESAIAN TRAVELLING SALESPERSON PROBLEM
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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Petra Christian University
2001-01-01
|
| Series: | Jurnal Informatika |
| Subjects: | |
| Online Access: | http://puslit2.petra.ac.id/ejournal/index.php/inf/article/view/15801 |