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.

1.
C.R.
Houck
,
M.G.
Kay
, “
A Genetic Algorithm for Function Optimization: A MATLAB Implementation
,”
Ncsuie Tr
, (
2008
).
2.
Yang
Cheng-Hong
,
Moi
Sin-Hua
,
Lin
Yu-Da
,
Chuang
Li-Yeh
, “
Genetic Algorithm Combined with a Local Search Method for Identifying Susceptibility Genes
,”
Journal of Artificial Intelligence and Soft Computing Research
6
, (
2016
).
3.
B.
Golden
,
A.
Assad
,
L.
Levy
,
F.
Gheysens
, “
The Fleet Size and Mix Vehicle Routing Problem
,”
Computers & Operations Research
11
,
49
66
(
1984
).
4.
Indrawati
,
N.
Eliyati
,
A.
Lukowi
, “
Penentuan Rute Optimal pada Pengangkutan Sampah di Kota Palembang dengan Menggunakan Metode Saving Matrix
,”
Jurnal Penelitian Sains
18
, (
2016
).
5.
P.G.
Pakusadewa
,
C.
Dewi
,
R.C.
Wihandika
, “
Penerapan Hibridisasi Algoritme Genetika dan Simulated Annealing untuk Optimasi Vehicle Routing Problem pada Kasus Pengangkutan Sampah Kota Denpasar
,”
Jurnal Pengembangan Teknologi informasi Dan Ilmu Komputer
, (
2017
).
6.
Armandi
,
Ekky
, “
Optimasi Rute Pengangkutan Sampah Kota Yogyakarta Menggunakan Hybrid Genetic Algorithm
,” (
2019
).
7.
Edmundo Bonilla
Huerta
,
Beatrice
Duval
,
Jin-Kao
Ha
, “
Gene Selection for Microarray Data by an LDA-Based Genetic Algorithm
,”
Springer Berlin Heidelberg
, (
2008
).
8.
U.
Maulik
,
S.
Bandyopadhyay
, “
Genetic algorithm-based clustering technique
,”
Pattern Recognition
, (
2000
).
9.
Jayanthi
Manicassamy
,
S. Sampath
Kumar
,
Mohana
Rangan
,
V.
Ananth
,
T.
Vengattaraman
,
P.
Dhavachelvan
, “
Gene Suppressor: An Added Phase Toward Solving Large-Scale Optimization Problems In The Genetic Algorithm
,
Applied Soft Computing J
35
, (
2015
).
10.
R.
Fukasawa
,
H.
Longo
,
J.
Lysgaard
,
M.P.
De Aragão
,
M.
Reis
,
E.
Uchoa
,
R.F.
Werneck
, “
Robust branch-and-cut-and-price for the capacitated vehicle routing problem
.
Mathematical Programming
, (
2006
).
11.
E.
Faiz
,
F.
El
, “
Studi Komparasi Penyelesaian Capacitated Vehicle Routing Problem (CVRP) Dengan Metode Saving Matrix Dan Generalized Assignment
,”
J Mhs Mat
4
, (
2013
).
12.
I. A.
Hasugian
,
Fernando
and
Supriadi
, “
Simulation of Queuing System for Customer Service Improvement: A Case Study
,”
IOP Conf. Ser.: Mater. Sci. Eng
851
, (
2020
).
13.
M. N.
Le
,
Y. S.
Ong
, and
Q. H.
Nguyen
,
"Optinformatics for schema analysis of binary genetic algorithms
," in
Proc. 10th Annu. Conf. GECCO
, (
2008
).
14.
D.
Whitley
, “
A genetic algorithm tutorial
,”
Statistics and Computing
, (
1994
).
15.
I. A.
Hasugian
,
Vandrick
and
D.
Evita
, “
Analysis Of Queuing Models Of Fast Food Restaurant with Simulation Approach
,”
IOP Conf. Ser.: Mater. Sci. Eng
851
, (
2020
).
This content is only available via PDF.
You do not currently have access to this content.