Pemanfaatan Metode Self Organizing Map Pada Optimasi Masalah Travelling Salesman Problem (original) (raw)
Travelling Salesman Problem (TSP) in development usually called classic graph problem. Salesman must a plan a course route to amount of city and visit every city once with entire distance shortly. There are several method that can give optimal solution to this problem. One of method is using computer technology that is Neural Network (NN). Self Organizing Map (SOM) Neural Network have a ability to self organizing input in to classification zone. The target of designed TSP with SOM method is to find a shortest route from the cities that must be visited. The result of experiment is to prove that SOM method could solved the TSP problem. Abstrak Travelling Salesman Problem (TSP) dalam perkembangannya sering disebut sebagai masalah graf klasik. Dimana seorang salesman harus merencanakan rute perjalanan ke sejumlah kota dan mengunjungi setiap kota sekali dengan jarak keseluruhan perjalanan yang sependek mungkin. Banyak metode yang diyakini dapat memberikan penyelesaian optimal terhadap pe...
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.