Ananda Risnandika Oktora, - (2024) PENYELESAIAN CLUSTERING TRAVELING SALESMAN PROBLEM DENGAN MENGGUNAKAN ALGORITMA LEXISEARCH. S1 thesis, Universitas Pendidikan Indonesia.
![[img]](http://repository.upi.edu/style/images/fileicons/text.png) |
Text
S_MAT_2008761_Title.pdf Download (997kB) |
|
Text
S_MAT_2008761_Chapter1.pdf Download (772kB) |
|
Text
S_MAT_2008761_Chapter2.pdf Restricted to Staf Perpustakaan Download (818kB) |
|
Text
S_MAT_2008761_Chapter3.pdf Download (1MB) |
|
Text
S_MAT_2008761_Chapter4.pdf Restricted to Staf Perpustakaan Download (1MB) |
|
Text
S_MAT_2008761_Chapter5.pdf Download (619kB) |
|
Text
S_MAT_2008761_Appendix.pdf Restricted to Staf Perpustakaan Download (553kB) |
Abstract
Penelitian ini membahas Clustering Traveling Salesman Problem (CTSP), yaitu masalah penentuan rute bagi seorang salesman ke sejumlah lokasi. Setiap lokasi harus dikunjungi tepat satu kali, dimulai dari depot dan kembali ke lokasi awal. Lokasi-lokasi yang akan dikunjungi diklasterkan berdasarkan kedekatan jarak antar lokasi-lokasi tersebut. Pada CTSP, setiap lokasi pada suatu klaster harus dikunjungi terlebih dahulu sebelum beranjak mengunjungi klaster lainnya. Pada penelitian ini, permasalahan CTSP diselesaikan menggunakan Algoritma Lexisearch. Algoritma ini bekerja dengan mencari rute dalam suatu tabel alfabet. Tabel Alfabet dikonstruksi melalui modifikasi matriks jarak agar aturan klaster tetap terjaga. Rute optimal diperoleh ketika rute lengkap pada suatu iterasi menghasilkan total jarak yang paling minimum. Hasil implementasi CTSP pada masalah pencarian rute sembako suatu Perusahaan di Bandung menunjukan bahwa rute pendistribusian dengan jarak terpendek berhasil diperoleh dengan mengaplikasikan Algoritma Lexisearch. This research studies Clustering Traveling Salesman Problem, a problem to find distribution routes (CTSP) for a salesman to visit a number of locations. Each location should visit exactly once, starting from a depot and returning to the depot. The locations are clustered based on the closest distance between them. On CTSP, each location in the same cluster must be visited first before moving to the other clusters. In this research, the CTSP is solved using the Lexisearch Algorithm. The algorithm works by finding routes on an alphabet table. The alphabet table is constructed by modifying the distance matrix such that the cluster rule is maintained. The optimal route is obtained if the complete route produces the shortest distance. The implementation results of CTSP on the problem to find the distribution routes of a basic food company in Bandung show that the optimal route is successfully obtained using the Lexisearch Algorithm.
| Item Type: | Thesis (S1) |
|---|---|
| Additional Information: | https://scholar.google.com/citations?user=i7h8IHIAAAAJ&hl=id ID SINTA Dosen Pembimbing: Khusnul Novianingsih: 258640 Sumanang Muhtar Gozali: 6121808 |
| Uncontrolled Keywords: | Rute Optimal, Clustering Traveling Salesman Problem, Algoritma Lexisearch, Klastering. Optimal Route, Clustering Traveling Salesman Problem, Lexisearch Algorithm, Clustering. |
| Subjects: | L Education > L Education (General) |
| Divisions: | Fakultas Pendidikan Matematika dan Ilmu Pengetahuan Alam > Jurusan Pendidikan Matematika > Program Studi Matematika (non kependidikan) |
| Depositing User: | Ananda Risnandika Oktora |
| Date Deposited: | 16 Aug 2024 02:40 |
| Last Modified: | 16 Aug 2024 02:40 |
| URI: | http://repository.upi.edu/id/eprint/120353 |
Actions (login required)
 |
View Item |