PEMANFAATAN METODE SELF ORGANIZING MAP PADA OPTIMASI MASALAH TRAVELLING SALESMAN PROBLEM
Total View This Week0
Total View This Week0
Institusion
Universitas Komputer Indonesia
Author
Suryono, Yulistian
Subject
2007
Datestamp
2016-11-16 07:46:46
Abstract :
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.
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.
Download
book
BibTex
Latex, Jabref
cloud_download
Original Resource
url resource Institution
