PUTRI, DINASTI HARYATI (2024) PENENTUAN RUTE DISTRIBUSI TERBAIK DENGAN BIAYA TRANSPORTASI MINIMAL MENGGUNAKAN METODE ALGORITMA CLARKE AND WRIGHT SAVINGS HEURISTIC (Studi Kasus di UD Sentral Oleh-oleh Kerupuk, Indramayu, Jawa Barat). Other thesis, UPN Veteran Yogyakarta.
![[thumbnail of 1. SRIPSI FULLTEXT_122200014_DINASTI HARYATI PUTRI.pdf]](http://eprints.upnyk.ac.id/style/images/fileicons/text.png) |
Text
1. SRIPSI FULLTEXT_122200014_DINASTI HARYATI PUTRI.pdf Restricted to Repository staff only Download (3MB) |
|
Text
2. COVER_122200014_DINASTI HARYATI PUTRI.pdf Download (61kB) |
|
Text
3. ABSTRAK_122200014_DINASTI HARYATI PUTRI.pdf Download (12kB) |
|
Text
4. LEMBAR PENGESAHAN_122200014_DINASTI HARYATI PUTRI.pdf Download (283kB) |
|
Text
5. DAFTAR ISI_122200014_DINASTI HARYATI PUTRI.pdf Download (204kB) |
|
Text
6. DAFTAR PUSTAKA_122200014_DINASTI HARYATI PUTRI.pdf Download (77kB) |
Abstract
xiii
ABSTRAK
Transportasi dan distribusi merupakan dua komponen yang mempengaruhi
keunggulan kompetitif suatu Perusahaan karena penurunan biaya distribusi dapat
meningkatkan keuntungan Perusahaan secara tidak langsung. Pengefisienan sistem
distribusi dan penggunaan jenis transportasi yang ada dapat menjadi suatu cara
untuk menurunkan biaya transportasi. UD Sentral Oleh-oleh merupakan Usaha
Dagang yang bergerak dalam bidang pangan khususnya dalam memproduksi
kerupuk. Terdapat 17 agen yang bekerjasama dengan pihak UD Sentral Oleh-oleh
Kerupuk. Dalam proses distribusi, terdapat 1 unit Truk Engkol dan 1 unit mobil
Pick-up. Proses distribusi yang diterapkan masih belum optimal karena dalam satu
kali pengantaran hanya untuk satu tujuan per harinya, belum memaksimalkan
kapasitas kendaraan dalam pendistribusian, dan belum memaksimalkan tenaga
driver yang ada.
Dalam penelitian ini metode yang digunakan berjumlah 2 metode yang
diawali dengan metode pengklasteran yaitu menggunakan metode Algoritma
Clarke and Wright Savings Heuristic dan dilanjutkan dengan metode pengurutan
menggunakan Nearest Insertion Heuristic. Keseluruhan metode memperhatikan
kapasitas, jarak tempuh dan waktu tempuh. Dengan menggunakan metode tersebut
akan didapatkan hasil berupa rute distribusi yang efektif dan efisien yang akan
berpengaruh ke biaya transportasi.
Penelitian ini menghasilkan rute distribusi yang terbaik dengan total jarak
18.700,6 km, total waktu selama 310 jam 16 menit dan total biaya sebesar Rp
36.865.759,92 dalam rentang waktu 4 bulan. Sedangkan rute aktual menghasilkan
total jarak 32.751,6 km, total waktu selama 343 jam 23 menit dan total biaya sebesar
Rp 97.000.000,00. Dari hasil tersebut dapat disimpulkan bahwa metode Algoritma
Clarke and Wright Savings dan metode Nearest Insertion dapat menekan jarak
tempuh 14.051 km, total waktu selama 33 jam 6 menit dari rute aktual serta
menghemat biaya sebanyak Rp 60.134.240,08. Oleh karena itu, penelitian yang
dilakukan telah berkontribusi pada perbaikan sistem distribusi Perusahaan dalam
segi biaya transportasi dan lebih menyeimbangkan beban kerja driver.
Kata kunci: rute distribusi, algoritma clarke and wright savings heuristic, nearest
insertion, capacitated vehicle routing problem.
xiv
ABSTRACT
Transportation and distribution are two components that influence a
company's competitive advantage because reducing distribution costs can increase
company profits indirectly. Streamlining the distribution system and using existing
types of transportation can be a way to reduce transportation costs. UD Sentral
Souvenirs is a trading business that operates in the food sector, especially in
producing crackers. There are 17 agents who collaborate with UD Sentral Souvenir
Kerupuk. In the distribution process, there is 1 unit of Crank Truck and 1 unit of
Pick-up car. The distribution process implemented is still not optimal because one
delivery is only for one destination per day, it has not maximized vehicle capacity
for distribution, and has not maximized the available driver power.
In this research, there are 2 methods used, starting with the clustering
method, namely using the Clarke and Wright Savings Heuristic Algorithm method
and continuing with the sorting method using the Nearest Insertion Heuristic. The
entire method takes into account capacity, travel distance and travel time. By using
this method, results will be obtained in the form of effective and efficient
distribution routes which will affect transportation costs.
This research produced the best distribution route with a total distance of
18,700.6 km, a total time of 310 hours 16 minutes and a total cost of IDR
36,865,759.92 over a period of 4 months. Meanwhile, the actual route resulted in a
total distance of 32,751.6 km, a total time of 343 hours 23 minutes and a total cost
of IDR 97,000,000.00. From these results it can be concluded that the Clarke and
Wright Savings Algorithm method and the Nearest Insertion method can reduce the
distance traveled by 14,051 km, a total time of 33 hours 6 minutes from the actual
route and save costs of IDR 60,134,240.08. Therefore, the research carried out has
contributed to improving the Company's distribution system in terms of
transportation costs and better balancing the workload of drivers.
Keywords: distribution route, algoritma clarke and wright savings heuristic,
nearest insertion, capacitated vehicle routing problem.
| Item Type: | Thesis (Other) |
|---|---|
| Uncontrolled Keywords: | distribution route, algoritma clarke and wright savings heuristic, nearest insertion, capacitated vehicle routing problem. |
| Subjects: | H Social Sciences > HD Industries. Land use. Labor |
| Divisions: | Faculty of Engineering, Science and Mathematics > School of Engineering Sciences |
| Depositing User: | Eko Yuli |
| Date Deposited: | 24 Jul 2024 02:50 |
| Last Modified: | 24 Jul 2024 02:50 |
| URI: | http://eprints.upnyk.ac.id/id/eprint/40372 |
Actions (login required)
 |
View Item |