PENENTUAN PERBAIKAN RUTE DISTRIBUSI PUPUK UREA MENGGUNAKAN METODE SWEEP
| Main Author: | wicaksono, abd rohman |
|---|---|
| Format: | Thesis NonPeerReviewed Book |
| Bahasa: | eng |
| Terbitan: |
, 2020
|
| Subjects: | |
| Online Access: |
http://eprints.umm.ac.id/59737/2/BAB%20I.pdf http://eprints.umm.ac.id/59737/3/BAB%20II.pdf http://eprints.umm.ac.id/59737/4/BAB%20III.pdf http://eprints.umm.ac.id/59737/5/BAB%20IV.pdf http://eprints.umm.ac.id/59737/6/BAB%20V.pdf http://eprints.umm.ac.id/59737/7/BAB%20VI.pdf http://eprints.umm.ac.id/59737/8/LAMPIRAN.pdf http://eprints.umm.ac.id/59737/49/PENDAHULUAN.pdf http://eprints.umm.ac.id/59737/ |
Daftar Isi:
- Vehicle Routing Problem (VRP) is one of the directly related for the optimal route repair that involves many vehicles by taking into account several regulations to serve retailers in accordance with the request. This thesis discussion explains the formation of rutel when discussing urea fertilizer distribution routes and improvements using sweep algorithms to make a better distribution route. Sweep algorithm is an algorithm consisting of two people, namely the first person consisting of a grouping agent and the second person who arranges the routes for each group. The method used in preparing the route at the time of writing this thesis uses the nearest neighbor method. This method step is to enter one by one agent from the closest distance that has not been visited into the route by taking into account the vehicle's requirements. This step is repeated until each agent is visited. From the calculations that have been done using the sweep algorithm, a total distance of 4108 km is obtained with vehicle mileage savings increasing 224.6 km or 5.18% much smaller than the total initial distance of 4332.6 km and saving total time delivery for 269, 5 or 4.49 hours. This shows that sweep algorithm can be used to get solutions to improve the distribution route of the company.