Claim Missing Document
Check
Articles

Found 1 Documents
Search

Penerapan Multi Travelling Salesman Problem Pada Optimasi Pendistribusian Bantuan Sosial Beras Sejahtera Studi Kasus: Perum Bulog Subdivre Malang Muhammad Nadzir; Imam Cholissodin; Bayu Rahayudi
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 3 (2019): Maret 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1151.471 KB)

Abstract

Distribution is an economic activity that bridges the production and consumption processes. The distribution process is distributing goods from producers to consumers. Bantuan Sosial Beras Sejahtera (Bansos Rastra) Program has a goal to improving the quality of service for the poor through fulfilling food needs. The distribution system of Bansos Rastra sending goods to each Distribution Point by Perum Bulog in accordance with the data distribution request. In the process of distributing goods, it is necessary to calculate the route distance in order to minimize travel time with the problems used in processing document data is Multi Traveling Salesman Problem (m-TSP) with Genetic Algorithm. From the evaluation results, the distribution routes for each warehouse are recommended by meeting the limits made. Based on the research carried out, the optimal parameters obtained were the size of the optimal number of generations of 300 generations, the optimal size of the population is 90 populations. The crossover probability value is 0.1 and the probability of mutation is 0.9 so that it gets the best average fitness value of 2.583. The final evaluation results produce the best chromosomes with a difference in the predicted distance that is more efficient than the actual distance so that the distribution process of Bansos Rastra can be more optimal.