Anda belum login :: 23 Nov 2024 11:24 WIB
Detail
BukuUsulan Metode Greedy Heuristic dan Saving Matrix untuk Meminimasi Biaya Distribusi (Studi Kasus: PT. Hero Supermarket, Tbk)
Bibliografi
Author: LISTIAWATI ; Hutahaean, Hotma Antoni (Advisor)
Topik: Greedy Heuristic; Saving Matrix Method; Cardboard box boundary; PT. Hero Supermarket; Tbk; Farthest Insert; Nearest Insert; Nearest Neighbor; Sweep
Bahasa: (ID )    
Penerbit: Program Studi Teknik Industri Fakultas Teknik Unika Atma Jaya     Tempat Terbit: Jakarta    Tahun Terbit: 2010    
Jenis: Theses - Undergraduate Thesis
Fulltext:
Ketersediaan
  • Perpustakaan Pusat (Semanggi)
    • Nomor Panggil: FTI-612
    • Non-tandon: tidak ada
    • Tandon: 1
 Lihat Detail Induk
Abstract
PT. Hero Supermarket, Tbk is a retailer company that almost having distribution process every day. PT. Hero Supermarket, Tbk have more than 90
distributions centre, but in this paper only discuss for Hero, Giant Supermarket and Giant Hypermarket, totally 67 distributions centre. Distribution system that held by PT. Hero Supermarket use Central system as Cibitung Central Warehouse, helped by Central Office Gatot Subroto. The Product ordered by distributions centre is aimed to Central Office and Central Office will ordered to supplier. The products sent directly by supplier to Cibitung Central Warehouse. Shipping to distributions centre have not a arrangement so that owned significance cost.
Distribution system arrangement are needed. It aimed to minimize cost. The calculation for distribution cost by using Greedy Heuristic Method, after that recommendation for the arrangement distribution will be given.Reccomandation of
arrangement in distribution do by Saving Matrix method, which method is use for arrange route distribution.The Input for this method by measuring distance from distributions centre to Central Warehouse Cibitung, vice versa and measuring
distance from one distributions centre to another distributions centre. The computation detailed by counting all distance for all route wish 4 method, there are Farthest Insert, Nearest Insert, Nearest Neighbor and Sweep.
Based on the calculation by using Greedy Heuristic Method, amoun of distribution costs are 949.222.396 and the objective that earned from Saving Matrix Method, it obtained 17 route with smallest distance are 699,37 with using Farthest
Insert method. This route will use for calculation amount of transportation that needed for each transportation capacity that have rent. Capacity of the transportation that rent by company are for 5.000 kg capacitu, 10.000 kg capacity and 20.000 kg capacity. Based on the calculation by using cardboard box boundary that can be accommodate by each truck, it get 1.983 trukc for 5.000 kg capacity, 867 trukc for 10.000 kg capacity and 554 truck for 20.000 kg capacity. The selection for
truck that will be used by compare the running cost and standing cost for each capacity. Based on that comparison, held truck with 10.000 kg capacity that used for distributions process at PT. Hero Supermarket, Tbk with distribution cost Rp.
903.331.380.
Opini AndaKlik untuk menuliskan opini Anda tentang koleksi ini!

Lihat Sejarah Pengadaan  Konversi Metadata   Kembali
design
 
Process time: 0.171875 second(s)