cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
FIRMAN TEMPOLA
Contact Email
firma.tempola@unkhair.ac.id
Phone
-
Journal Mail Official
if_jiko@unkhair.ac.id
Editorial Address
-
Location
Kota ternate,
Maluku utara
INDONESIA
Jiko (Jurnal Informatika dan komputer)
Published by Universitas Khairun
ISSN : 26148897     EISSN : 26561948     DOI : -
Core Subject : Science,
Computer Science & IT
Jiko (Jurnal Informatika dan Komputer) Ternate adalah jurnal ilmiah diterbitkan oleh Program Studi Teknik Informatika Universitas Khairun sebagai wadah untuk publikasi atau menyebarluaskan hasil - hasil penelitian dan kajian analisis yang berkaitan dengan bidang Informatika, Ilmu Komputer, Teknologi Informasi, Sistem Informasi dan Sistem Komputer. Jurnal Informatika dan Komputer (JIKO) Ternate terbit 2 (dua) kali dalam setahun pada bulan April dan Oktober
Arjuna Subject : -
Articles 241 Documents
 21   22   23   24   25 
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.

Page 25 of 25 | Total Record : 241

 21   22   23   24   25 

Filter by Year

2017 2025


Reset
Filter By Issues
All Issue Vol 8, No 2 (2025) Vol 8, No 1 (2025) Vol 7, No 3 (2024) Vol 7, No 2 (2024) Vol 7, No 1 (2024) Vol 6, No 2 (2023): JIKO (Jurnal Informatika dan Komputer) Vol 6, No 1 (2023) Vol 5, No 3 (2022) Vol 5, No 2 (2022) Vol 5, No 1 (2022) Vol 4, No 3 (2021) Vol 4, No 2 (2021) Vol 4, No 1 (2021) Vol 3, No 3 (2020) Vol 3, No 2 (2020) Vol 3, No 1 (2020) Vol 2, No 2 (2019) Vol 2, No 1 (2019) Vol 1, No 2 (2018) Vol 1, No 1 (2018) Vol 1, No 2 (2017): Jurnal Informatika dan Komputer (JIKO) Ternate Vol 1, No 1 (2017): Jurnal Informatika dan Komputer (JIKO) Ternate More Issue