Universitas Pattimura :: Repository Paper

Judul:	Model Integer Liniear Programming (Ilp) Dalam Pemecahan Traveling Salesman Problem (TSP) (Studi Kasus : PT. Paris Jaya Mandiri â€“ Ambon)
Penulis:	D. B. Paillin & J. M. Tupan \|\| email: daniel.paillin@fatek.unpatti.ac.id
Jurnal:	Prosiding Archipelago Engineering 2020 Vol. 1 no. 1 - hal. 40-47 Tahun 2020 [ Teknik ]
Keywords:	optimal route, traveling salesman problem, integer linier programming
Abstract:	Traveling Salesman Problem (TSP) is a matter of determining vehicle routes by finding the minimum distance from the starting point to all destination points and returning to the starting point with the assumption that all destination points to be traversed are only visited once to get the optimal route of product distribution. This research tries to use the Integer Linear Programming (ILP) method in solving the TSP problem. Benchmarks used in this method are the distance between outlets starting from measuring each distance from the warehouse to the outlet and returning to the warehouse which is spread in the Sirimau 1 and 2 distribution areas and the Nusaniwe distribution area. The results showed that the Integer Linear Programming method has output efficiency of the route both in terms of distance of 26.32% and a total time of 7.42% of the company's regular routes.
File PDF:	Download fulltext PDF

Akses dari IP Address 13.59.34.87

Universitas Pattimura :: Paper Repository