Text
VEHICLE ROUTING PROBLEM MENGGUNAKAN METODE SAVING MATRIX DAN ALGORITMA GENETIKA UNTUK MENENTUKAN RUTE TERPENDEK PENDISTRIBUSIAN TANDAN BUAH SEGAR (TBS) KELAPA SAWIT (STUDI KASUS CV. SEJAHTERA TANI MANDIRI)
This study aims to determine the shortest transportation route for the distribution of oil palm Fresh Fruit Bunches (FFB) from the Product Collection Place to the Palm Oil Mill in CV. Sejahtera Tani Mandiri. The problem in this research is solved using an optimization model, namely the Vehicle Routing Problem (VRP) with a heuristic approach, namely the Saving Matrix method and Genetic Algorithm. CV. Sejahtera Tani Mandiri consists of Block A with 14 main TPH and Block B with 14 main TPH. The use of the Saving Matrix method in block A has 14 initial routes each day so that the savings in the number of routes for Monday and Friday are 7 routes, for Tuesdays, Thursdays and Saturdays there are 9 routes, for Wednesdays it becomes 10 routes. In Block B, there are 14 initial routes each day, so that the route savings for Monday, Thursday, Friday and Saturday are 9 routes, for Tuesday it is 8 routes, for Wednesday it is 10 routes. Using the Genetic Algorithm in Block A, there are 14 initial routes each day so that the savings in the number of routes for Monday and Friday are 8 routes, for Tuesdays it becomes 9 routes, for Wednesdays, Thursdays and Saturdays it becomes 10 routes. In Block B, there are 14 initial routes each day, so that the route savings for Monday and Thursday are 10 routes, for Tuesday, Wednesday, Friday and Saturday it is 9 routes. Based on the comparison of routes generated from calculations using the Saving Matrix method and Genetic Algorithm, there are savings in mileage and the number of routes for Block A and Block B.
Inventory Code | Barcode | Call Number | Location | Status |
---|---|---|---|---|
2207004070 | T78664 | T786642022 | Central Library (Referens) | Available but not for loan - Not for Loan |
No other version available