BibTex Citation Data :
@article{JSINBIS47041, author = {Munji Hanafi and Budi Warsito and Rahmat Gernowo}, title = {Sistem Informasi Manajemen Pengumpulan dan Pengangkutan Sampah Padat dengan Efisiensi Rute Menggunakan K-Means Clustering dan Travelling Salesman Problem}, journal = {JSINBIS (Jurnal Sistem Informasi Bisnis)}, volume = {12}, number = {2}, year = {2022}, keywords = {Solid Municipal Waste (SMW); Waste Management; K-means Clustering; Traveling Salesman Problem (TSP); OR-Tools; Decision Support System (DSS)}, abstract = { The increasing population growth and rapid urbanization have resulted in large amounts of solid municipal waste (SMW). Nowadays, the problem of waste management is a problem that is being experienced by every country in the world. As a result, implementing efficient waste management strategies is increasingly needed. The collection and transportation of solid waste is the most important thing to pay attention to in waste management efficiency to reduce the costs of collecting and transporting solid waste. The research started by collecting data and interviewing the environmental services of Semarang City about the waste transportation system in Semarang City. The results of the data and interviews will then be used as a reference for the system analysis to be made. Then proceed with designing information systems. After that, the information system was developed by applying the Traveling Salesman Problem (TSP) method using a heuristic in the form of K-means Clustering. With the help of OR-Tools, TSP completion does not require node distance, just inputting the coordinates of each node. The study closed system testing. This research proposes a new approach to solving TSP. First is the process of assembling nodes into several clusters. Then, look for the shortest route in each cluster. The research resulted in 21 routes in 16 corridors to transport waste in Semarang City, presented on a map on a web-based Information System as Decision Support System (DSS). The comparison of the methods shows that TSP is the most suitable for this case. }, issn = {2502-2377}, pages = {106--115} doi = {10.21456/vol12iss2pp106-115}, url = {https://ejournal.undip.ac.id/index.php/jsinbis/article/view/47041} }
Refworks Citation Data :
The increasing population growth and rapid urbanization have resulted in large amounts of solid municipal waste (SMW). Nowadays, the problem of waste management is a problem that is being experienced by every country in the world. As a result, implementing efficient waste management strategies is increasingly needed. The collection and transportation of solid waste is the most important thing to pay attention to in waste management efficiency to reduce the costs of collecting and transporting solid waste. The research started by collecting data and interviewing the environmental services of Semarang City about the waste transportation system in Semarang City. The results of the data and interviews will then be used as a reference for the system analysis to be made. Then proceed with designing information systems. After that, the information system was developed by applying the Traveling Salesman Problem (TSP) method using a heuristic in the form of K-means Clustering. With the help of OR-Tools, TSP completion does not require node distance, just inputting the coordinates of each node. The study closed system testing. This research proposes a new approach to solving TSP. First is the process of assembling nodes into several clusters. Then, look for the shortest route in each cluster. The research resulted in 21 routes in 16 corridors to transport waste in Semarang City, presented on a map on a web-based Information System as Decision Support System (DSS). The comparison of the methods shows that TSP is the most suitable for this case.
Article Metrics:
Last update:
Last update: 2023-09-27 23:54:45
Penulis yang mengirimkan naskah harus memahami dan menyetujui bahwa jika diterima untuk dipublikasikan, hak cipta dari artikel adalah milik JSINBIS dan Universitas Diponegoro sebagai penerbit jurnal.Hak cipta (copyright) meliputi hak eksklusif untuk mereproduksi dan memberikan artikel dalam semua bentuk dan media, termasuk cetak ulang, foto, mikrofilm dan setiap reproduksi lain yang sejenis, serta terjemahan. Penulis mempunyai hak untuk hal-hal berikut:
JSINBIS dan Universitas Diponegoro serta Editor melakukan segala upaya untuk memastikan bahwa tidak ada data, pendapat atau pernyataan yang salah atau menyesatkan yang dipublikasikan di jurnal ini. Isi artikel yang diterbitkan di JSINBIS adalah tanggung jawab tunggal dan eksklusif dari masing-masing penulis.
View My Stats This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.