skip to main content

Sistem Informasi Manajemen Pengumpulan dan Pengangkutan Sampah Padat dengan Efisiensi Rute Menggunakan K-Means Clustering dan Travelling Salesman Problem

*Munji Hanafi orcid publons  -  Universitas Diponegoro, Indonesia
Budi Warsito orcid  -  Universitas Diponegoro, Indonesia
Rahmat Gernowo orcid  -  Universitas Diponegoro, Indonesia
Open Access Copyright (c) 2022 JSINBIS (Jurnal Sistem Informasi Bisnis)

Citation Format:
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.

Fulltext View|Download
Keywords: Solid Municipal Waste (SMW); Waste Management; K-means Clustering; Traveling Salesman Problem (TSP); OR-Tools; Decision Support System (DSS)

Article Metrics:

  1. Amponsah, S., &Salhi, S., 2004. The investigation of a class of capacitated arc routing problems: the collection of garbage in developing countries. Waste Management, 24(7), 711–721
  2. Archetti, C., Guerriero, F., &Macrina, G., 2021. The online vehicle routing problem with occasional drivers. Computers & Operations Research, 127, 105144
  3. Directions API., 2022, May 9. Mapbox. https://docs.mapbox.com/api/navigation/directions/
  4. Jünger, M., Reinelt, G., & Rinaldi, G., 1995. The traveling salesman problem. Handbooks in operations research and management science, 7, 225-330
  5. Kalra, M., Lal, N., & Qamar, S., 2018. K-mean clustering algorithm approach for data mining of heterogeneous data. In Information and Communication Technology for Sustainable Development (pp. 61-70). Springer, Singapore
  6. Pooja Vaishnav, Naveen Choudhary, and Kalpana Jain. Traveling salesman problem using genetic algorithm: a survey. International Journal of Scientific Research in Computer Science, Engineering and Information Technology, 2(3):105–108, 2017
  7. Rokbani, N., Kumar, R., Abraham, A., Alimi, A. M., Long, H. V., Priyadarshini, I., & Son, L. H., 2020. Bi-heuristic ant colony optimization-based approaches for traveling salesman problem. Soft Computing, 25(5), 3775–3794
  8. Sommerville, I., 2011. Software Engineering, 9/E. Pearson Education India

Last update:

No citation recorded.

Last update: 2024-05-27 22:06:29

No citation recorded.