ANALISA OPTIMASI RUTE TRANSPORTASI ANTAR JEMPUT SISWA MENGGUNAKAN METODE CGVRP DAN ALGORITMA DIJKSTRA DI SDIT SAMAWA CENDEKIA

Abstract

The school bus is one of the means of transportation prepared by several schools as a means of shuttle to make it easier for their students to travel
in school activities, so that in the pick-up process a better route is needed
optimally to save fuel. The purpose of this research is to compile
model of shuttle transportation routes for students with the Clustered Generalized model
Vehicle Routing Problem (CGVRP) then the model is solved
using Dijkstra's Algorithm and comparing the distance between real transportation routes
pick-up with route distance using the CGVRP model and Dijkstra's Algorithm. Model
CGVRP uses the Djikstra Algorithm which is applied to the shuttle case study
students at SDIT Samawa Cendekia are more efficient than the longer distances
used before. It is known that the real distance at SDIT Samawa Cendekia is
2,627,424 meters at a cost of Rp. 2,118,384 in a month. While the distance on the route
the proposal obtained 2,389,128 meters at a cost of Rp. 1,926,757 in a month. So
the difference between the distance from the real route and the proposed route is 238,296 meters with a difference of
cost Rp. 191,604 in a month.