Pendekatan Baru Penyelesaian Traveling Salesman Problem dengan Jaringan Syaraf Tiruan
| Main Authors: | Supardi, Julian, Famela, Rany |
|---|---|
| Format: | Article PeerReviewed application/pdf |
| Terbitan: |
Fakultas Teknologi Informasi Universitas Tarumanegara
, 2012
|
| Subjects: | |
| Online Access: |
http://eprints.unsri.ac.id/2909/1/Revisi_Full_Paper_SNTI_Julian.pdf http://www.ilkom.unsri.ac.id http://eprints.unsri.ac.id/2909/ |
Daftar Isi:
- Problems in Solving Traveling Salesman Problem (TSP) include the slow turnaround time and the small number of cities that can be solved optimally. This study aimed to try a new approach to solve TSP with Artificial Neural Networks. This new approach was performed hybridizing Hopfield algorithm with Djikstra algorithm. Thus the city need to be divided into several zones. Each zone sought the shortest route using Hopfield, then algorithms Djikstrab is used. From the test results, the accuracy of the approach developed different for each number of cities in a single zone. The ideal number for one zone were 1 or 3 cities, but when 2,4, or 5 cities in one zone showed bad result. However these results have improved settlement outcomes TSP with Hopfield algorithm