Open AccessPencarian Jalur Terpendek Menggunakan Metode Algoritma “Ant Colony Optimization” Pada GUI Matlab (Studi Kasus: PT Distriversa Buana Mas cabang Purwokerto)
Author(s) -
Via Risqiyanti,
Hasbi Yasin,
Rukun Santoso
Publication year - 2019
Publication title -
jurnal gaussian : jurnal statistika undip
Language(s) - English
Resource type - Journals
ISSN - 2339-2541
DOI - 10.14710/j.gauss.v8i2.26671
Subject(s) - shortest path problem , ant colony optimization algorithms , travelling salesman problem , computer science , operations research , mathematical optimization , business , mathematics , artificial intelligence , graph , theoretical computer science
For company, shortest distribution route is an important thing to be developed in order to obtain effectiveness in the distribution of products to consumers. One way of development is to find the shortest route with Ant Colony Optimization algorithm. This algorithm is inspired by the behavior of ant colonies that can find the shortest path from the nest to the food source. One example of a distribution company is PT Distriversa Buana Mas, also known as DBM. DBM is a physical distribution company covering the entire Indonesian archipelago specialized in the distribution of pharmaceuticals and consumer goods such as personal care, cosmetic and food products. DBM uses land transportation in 18 brances spread across Indonesia. One branch of DBM is in the Purwokerto region that distributes products to 29 stores in the Purbalingga region. This research is done with the help of GUI as a computation tool. Based on test results, the GUI system that has been built able to simplify and speed up the selection process of finding the shortest route for distribute product of DBM in the Purbalingga region. Keywords: Travelling Salesman Problem, Distriversa Buana Mas, Algorithm, Ant Colony Optimization, GUI