Abdullah, Dandi and Suntoro, Suntoro and Nur Siswanto, Budi (2022) ANALISIS DISTRIBUSI ANGKUTAN POS DI KANTOR POS SUMEDANG DENGAN METODE TRAVELING SALESMAN PROBLEM TUGAS AKHIR (TA.16.18.22.22). Masters thesis, STIMLOG INDONESIA.
![[img]](http://eprint.ulbi.ac.id/style/images/fileicons/text.png) |
Text
BAB 1.pdf Download (218kB) |
Abstract
ABSTRACT The problem that occurs at PT Pos Indonesia Sumedang is that the distribution of postal transportation is not optimal. This is because the load on the fleet is less than optimal and the driver's working hours are also less than optimal. Distribution starts at 14:00 to 19:00. The distribution of postal transportation at PT Pos Indonesia Sumedang uses 4 fleets through 4 different routes to reach 14 Branch Post Offices (KPC) and 1 Postal Agent. In line 1 the occupancy of the charge is less than 50% and records a total distribution time of 2 hours 40 minutes, on line 2 the occupancy of a charge is less than 80% and records a total distribution time of 3 hours 57 minutes, on line 3 the occupancy of a charge is less than 50% and records a total distribution time was 2 hours 52 minutes, line 4 was less than 20% occupied and recorded a total distribution time of 1 hour 16 minutes. Something can be said to be optimal if it gets maximum or minimal results according to its function. The load on the fleet at the Sumedang Post Office does not work optimally. Then the total distribution time generated is also not optimal, this is because the distribution is given a time of 5 hours. If the distribution has been completed but there is still a lot of time left, nothing can be done, because the operating hours of the night hours start at 19:00. Therefore, the load on the fleet and the driver's working hours will be optimized to be more leverage. Optimization will be carried out by merging the paths, namely lane 1 with lane 3 and then lane 2 with lane 4. The path merging is based on the average daily data of load occupancy. After optimizing the fleet load and the driver's working hours to make it more leverage, the next step is to determine the sequence of KPC routes that must be traversed first in order to produce a minimum total distance. The minimum total distance required so as not to exceed the set distribution time limit is 19:00. The research method used is Evolutionary Algorithm using Solver tools from Microsoft Office Excel application. Evolutionary Algorithm is a method to solve the Traveling Salesman Problem (TSP) transportation problem. The Evolutionary Algorithm in the excel solver works to get a minimum total distance and can find out which KPC route sequences are visited first. The results showed that the order of distribution routes was divided into 2 lines. The order of travel routes for the combined route 1 and 3 is the Central Post - KPC Situraja - KPC Daramaraja - KPC Wado - KPC Rancakalong - KPC Tanjungsari - KPC Cikeruh - KPC Cimanggung - Pos Pusat. Then the order of travel routes for the combined route 2 and 4 is the Central Post - KPC Cimalaka - KPC Paseh - KPC Tomo - KPC Ujungjaya - KPC Conggeang - KPC Buahdua - KPC Tanjungkerta - Angkrek Postal Agent - Central Post. The results also show that there is a savings of Rp. 183.009 per day when using distribution after the research is compared with the initial distribution used by PT Pos Indonesia Sumedang. Keywords : Distribution, Optimal, Evolutionary Algorithm, Solver
| Item Type: | Thesis (Masters) |
|---|---|
| Subjects: | H Social Sciences > HD Industries. Land use. Labor H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management |
| Depositing User: | Unnamed user with email [email protected] |
| Date Deposited: | 11 Aug 2022 04:00 |
| Last Modified: | 11 Aug 2022 04:00 |
| URI: | http://eprint.ulbi.ac.id/id/eprint/1475 |
Actions (login required)
 |
View Item |
