2021
DOI: 10.52158/jacost.v2i1.168
|View full text |Cite
|
Sign up to set email alerts
|

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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…The chosen generation is the generation that represents improvements in the previous population or group. By performing a repetitive process, this algorithm can get the most appropriate solution to the problem at hand [15]; [16].…”
Section: Introductionmentioning
confidence: 99%
“…The chosen generation is the generation that represents improvements in the previous population or group. By performing a repetitive process, this algorithm can get the most appropriate solution to the problem at hand [15]; [16].…”
Section: Introductionmentioning
confidence: 99%
“…This example demonstrates the practical uses of TSP in robots and autonomous systems, where coverage planning relies on finding the shortest, most efficient paths. Additionally, Aswandi et al [9] proposed TSP in addressing logistics and transportation problems to determine the garbage pickup's shortest path. This study provides a realistic illustration of how the TSP can be used when resource allocation and cost-effective operations based on optimal route.…”
Section: Introductionmentioning
confidence: 99%