| Abstract | ABSTRACT. Travelling Salesman Problem (TSP) is a problem to find the shortest path a salesman visits all the cities exactly once, and returns to the starting city. In this reseacrh, the methods for TSP used are the nearest insertion method, the cheapest insertion method, and the farthest insertion method. The program for deciding the minimum TSP from three insertion methods was created with the help of the function of Software R. The TSP using three insertion methods do not always have the same weight and route.Key words: Travelling Salesman Problem, Nearest Insertion Method, Cheapest Insertion Method, Farthest Insertion Method, and Software R. ABSTRAK. Travelling Salesman Problem (TSP) merupakan permasalahan mencari lintasan terpendek seorang salesman harus mengunjungi semua kota yang akan dituju tepat satu kali, dan kembali ke kota awal. Pada penelitian ini, penyelesaian TSP menggunakan metode nearest insertion, metode cheapest insertion, dan metode farthest insertion. Program minimum TSP dari ketiga metode dibuat dengan bantuan fungsi Software R. Hasil TSP dengan menggunakan tiga metode insertion tidak selalu menghasilkan bobot dan rute lintasan yang sama namun bergantung pada data yang digunakan.Kata kunci: Travelling Salesman Problem, Metode Nearest Insertion, Metode Cheapest Insertion, Metode Farthest Insertion, dan Software R. |
|---|