Article Per Year (5 Year)
p-Index From 2020 - 2025
0.408
P-Index
This Author published in this journals
All Journal Jiko (Jurnal Informatika dan komputer)
safitri, yayang
Unknown Affiliation
Computer Science & IT

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
DETERMINING THE OPTIMAL ROUTE OF BULOG RICE DISTRIBUTION USING SEQUENTIAL INSERTION AND NEAREST NEIGHBOUR METHOD Safitri, Yayang; Rakhmawati, Fibri; Aprillia, Rima
JIKO (Jurnal Informatika dan Komputer) Vol 7, No 1 (2024)
Publisher : Universitas Khairun

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33387/jiko.v7i1.7443

Abstract

Rice consumption in Indonesia is the 4th highest in the world, with an annual average of 35.3 million tonnes. Apart from that, domestic rice production is relatively low, so finding an optimal distribution pattern to meet Indonesia's food consumption needs is necessary. This research aims to find the best route for rice distribution using sequential insertion and nearest-neighbor methods. The aim is to compare the two methods to determine which is suitable for distributing rice. Apart from that, comparisons are made to find the distribution route with the shortest distance and fastest time. The research results show that the optimal travel distance using the sequential insertion method is t = 1, namely 519 Km with a travel time of 779 minutes. Meanwhile, the optimal travel distance using the nearest neighbor method at r = 1 is 506 km with a travel time of 535 minutes. Thus, this problem's nearest neighbor method performs better than sequential insertion.
DETERMINING THE OPTIMAL ROUTE OF BULOG RICE DISTRIBUTION USING SEQUENTIAL INSERTION AND NEAREST NEIGHBOUR METHOD Safitri, Yayang; Rakhmawati, Fibri; Aprillia, Rima
JIKO (Jurnal Informatika dan Komputer) Vol 7, No 1 (2024)
Publisher : Universitas Khairun

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33387/jiko.v7i1.7443

Abstract

Rice consumption in Indonesia is the 4th highest in the world, with an annual average of 35.3 million tonnes. Apart from that, domestic rice production is relatively low, so finding an optimal distribution pattern to meet Indonesia's food consumption needs is necessary. This research aims to find the best route for rice distribution using sequential insertion and nearest-neighbor methods. The aim is to compare the two methods to determine which is suitable for distributing rice. Apart from that, comparisons are made to find the distribution route with the shortest distance and fastest time. The research results show that the optimal travel distance using the sequential insertion method is t = 1, namely 519 Km with a travel time of 779 minutes. Meanwhile, the optimal travel distance using the nearest neighbor method at r = 1 is 506 km with a travel time of 535 minutes. Thus, this problem's nearest neighbor method performs better than sequential insertion.
Co-Authors Aprillia, Rima Rakhmawati, Fibri