RESI ANGGRAINI, - (2020) OPTIMASI RUTE DISTRIBUSI DALAM MENYELESAIKAN TRAVELLING SALESMAN PROBLEM MENGGUNAKAN ALGORITMA TABU SEARCH (Studi Kasus: CV. Bintang Anugerah Sukses Pekanbaru). Skripsi thesis, UNIVERSITAS ISLAM NEGERI SULTAN SYARIF KASIM RIAU.

	Text (BAB IV) PEMBAHASAN.pdf - Published Version Restricted to Repository staff only Download (1MB)
	Text GABUNGAN.pdf Download (7MB)

Abstract

ROUTE OPTIMIZATION DISTRIBUSION IN SOLVING TRAVELLING SALESMAN PROBLEM USING TABOO SEACRH ALGORITHM (Case Study: CV. Bintang Anugerah Sukses Pekanbaru) RESI ANGGRAINI 11654200044 Date of Final Exam : 24 June 2020 Date of Graduation : Mathematics of Departement Faculty of Science and Technology State Islamic University of Sultan Syarif Kasim Riau Soebrantas Street No. 155 Pekanbaru ABSTRACT CV. Bintang Anugerah Sukses is a company enganged in the distribution of product from PT. Belfoods Indonesia. One type of distribution’s goods is frozen goods. Distribution of frozen goods distributes to 12 customer agencies which using one vehicle. CV. Bintang Anugerah Sukses not use special methods in distribution of goods. The route distribution is determined based on experience and subjective decisions of salesman in charge of distributing goods. The resulted in the distribution of goods ineeffective and inefficient. The problem will be solved using an approach the Travelling Salesman Problem (TSP) , so the best route for distributing goods can be obtained that can minimum mileage and time. One of methods applied to the travelling salesman problem is taboo search algorithm. Taboo search is one of the metaheuristic methods with the process of searching moving from one solution to the next. The algorithm uses a taboo list to store a set of solutions that have just been evaluated, the result will be adjusted first to the contents of the taboo list to see whether the solution already exists or not. If the solution already exists then the solution will not be evaluated. The calculation results obtained a minimum mileage of 53,6 km and minimum of time 305 minutes or 5 hours 5 minutes. Keywords: Distribution, Route, Tabu Search, Travelling Salesman Problem.

Actions (login required)

View Item