Penyelesaian Traveling Salesman Problem pada Perusahaan Distribusi Produk Dengan Algoritma Farthest Insertion

Lisnawanty

Penyelesaian Traveling Salesman Problem pada Perusahaan Distribusi Produk Dengan Algoritma Farthest Insertion Penyelesaian Traveling Salesman Problem pada Perusahaan Distribusi Produk Dengan Algoritma Farthest Insertion

Lihat/Buka File Repository

Paper: Penyelesaian (672 KB)

Lihat/Buka File Peer Review

Peer Review: Penyele (422 KB)

Tanggal

2016-12-01

Penulis

Lisnawanty,

Abstraksi

A Company is an organization that has a complexity of problems in managing the relationship between retailers and distributors to keep the process running smoothly distributing products. The problems that often occur in the distribution company is to determine the best route for delivering products to a number of retailers that will be visited. In the case of Traveling Salesman Problem, this study made some observations on Yakult Company in Pontianak. Based on observations, it is known that the distribution system is done simply. In other words, there is no strategy developed to make the process of distribution, so that in one distribution process not all retailers can be visited. This study discusses the Traveling Salesman Problem solving problems in product distribution company. The method used is the method of heuristic algorithms using Farthest Insertion.

Kata Kunci: Traveling Salesman Problem, farthest insertion, retailers, distribution

URI
https://ejournal.bsi.ac.id/ejurnal/index.php/khatulistiwa/article/view/1268

Bidang ilmu
Software Akuntansi