Supardi, Julian and Famela, Rany (2012) Pendekatan Baru Penyelesaian Traveling Salesman Problem dengan Jaringan Syaraf Tiruan. PROSIDING SNTI 2012, 9 (1). pp. 1-7. ISSN 1829-9156
Preview |
Text
Revisi_Full_Paper_SNTI_Julian.pdf Download (1MB) | Preview |
Abstract
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
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Traveling Salesman Problem, TSP, Hopfiled, Djikstra |
| Subjects: | T Technology > TA Engineering (General). Civil engineering (General) > TA174.A385 Engineering design--Data processing. Manufacturing processes--Data processing. Computer integrated manufacturing systems. Manufacturing processes--Automation. CAD/CAM systems. |
| Divisions: | 09-Faculty of Computer Science > 55201-Informatics (S1) |
| Depositing User: | Mr. Julian Supardi |
| Date Deposited: | 04 Oct 2019 03:12 |
| Last Modified: | 04 Oct 2019 03:12 |
| URI: | http://repository.unsri.ac.id/id/eprint/9366 |
Actions (login required)
 |
View Item |