Model Penentuan Rute Terpendek Penjemputan Sampah Menggunakan Metode MTSP dan Algoritma Genetika

Abstract

Garbage pick-ups performed by two or more people must have a route in their pickup. However, it is not easy to model the route of the pickup that each point must be passed and each point is only passed once. Now, the method to create a route has been done a lot, one of the most commonly used methods is the creation of routes using the Traveling Salesman Problem method. Traveling Salesman Problem is a method to determine the route of a series of cities where each city is only traversed once. In this study, the shortest route modeling was conducted using Multiple Traveling Salesman Problem and Genetic Algorithm to find out the shortest route model that can be passed in garbage pickup. In this study, datasets will be used as pick-up points to then be programmed to model the shortest routes that can be traveled. The application of Multiple Traveling Salesman Problem method using Genetic Algorithm shows success to model garbage pickup route based on existing dataset, by setting the parameters of 100 generations and 100 population and 4 salesmen obtained 90% of the best individual opportunities obtained with the best individual fitness value of 0.05209. The test was conducted using BlackBox testing and the results of this test that the functionality on the system is 100% appropriate.