| Autor: |
Hasugian, Ivo Andika, Lestari, Nanda, Nasution, Dian Morfi, Bukit, Ferry Rahmat Astianta |
| Předmět: |
|
| Zdroj: |
AIP Conference Proceedings; 2023, Vol. 2741 Issue 1, p1-10, 10p |
| Abstrakt: |
Garbage is a crucial problem faced by big cities in Indonesia, and one of them is Medan City. The increase in population in Medan City is one of the causes of the rise in the amount of waste generated from the implications of the increasing public consumption activities. In this case, the waste collection process is the most significant contributor to the waste processing costs, so it is necessary to determine the optimal route for waste transportation to minimize the cost of processing the waste. Literature studies show that the problem of m-TSP, often referred to as the Vehicle Routing Problem (VRP), can be defined as a problem of finding a route with minimal costs from a depot to customers who scattered with several different requests. This route is designed so that each customer is only visited once by one vehicle. This study succeeded in developing an m-TSP or VRP model using a Genetic Algorithm (GA) to determine the optimal route for waste transportation in Medan City. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
