Lampiran 1. Struktur organisasi pada departemen supply chain managment

Transkripsi

1 LAMPIRAN 16

2 17 Lampiran 1 Struktur organisasi pada departemen supply chain managment

3 18 Lampiran 2 Saluran distribusi yang ada P R O D U S E N Agen Stock Point (SP) Retail/outlet (RO) Distribution Center (DC) Institusi hawker Motor warung K O N S U M E N

4 19 Lampiran 3 Diagram alir pada saluran distribusi retail/outlet Purcahased Order (PO) Konsumen Sales admin Warehouse Operator - Delivery note (DN) - Faktur penjualan - PO - F P (stempel, ttd) - D N (stempel, ttd) - Check product - Display - Bukti Terima Barang - Sisa Stock/ titipan (bila ada) - Nota Penarikan Barang - Product/ Roti BS & Crate - DN - Faktur penjualan (FP) - PO - Product/ roti & crate - DN - Sisa stock/ titipan (bila ada) - Nota penarikan barang - Product/ roti BS & crate loading unloading Divisi Distribusi Driver & helper

5 20 Lampiran 4 Beberapa gambar: Pemisahan permintaan Kendaraan saat loading

6 21 Memasukkan pesanan ke mobil-box Penghitungan roti

7 22 Sisa roti Crate kosong saat unloading

8 23 Lampiran 5 Matriks Jarak

9 24 Lampiran 6 Data No Nama Tempat Permintaan (crate) Waktu bongkar-muat (menit) 0 PT. NIC 1 HARI-HARI BEKASI TRADE CENTRE MITRA WISMA ASRI LION SUPERINDO BOROBUDUR BEKAS PT.CONTIMAS UTAMA IND. (BLUE MALL) CARREFOUR BEKASI SQUARE HERO KEMANG PRATAMA GIANT HYPERMARKET BEKASI LION SUPERINDO METROPOLITAN MALL MAKRO BEKASI HARI-HARI BEKASI CYBER PARK CV. NAGA SWALAYAN (Pondok Ungu) GIANT UJUNG MENTENG CARREFOUR CAKUNG LION SUPERINDO KALIMALANG BEKASI GIANT PONDOK KOPI SPM GIANT JATI BENING STAR MART PERSADA GOLF TIP-TOP PONDOK GEDE GIANT PONDOK GEDE CV. NAGA SWALAYAN (Jatiwaringin) TIP-TOP PONDOK BAMBU GIANT KALIMALANG SUPER INDO PONDOK BAMBU YOGYA PONDOK BAMBU TOSERBA 18 73

10 25 Lampiran 7 Input Berupa file.dat yang berisi sebagai berikut:

11 26 Lampiran 8 Proses Source code yang digunakan sebagai berikut: #include <ildispat/dispatch.h> #include <ildispat/rplan.h> #if defined(ilusestl) #include <iostream> #include <fstream> #include <string> #else #include <iostream.h> #include <fstream.h> #include <string.h> #endif ILCSTLBEGIN void Info(IlcManager m, IlcRoutingPlan plan, char * problem) { //////////////////////////////////////////////////////// // informasi aja //////////////////////////////////////////////////////// m.printinformation(); plan.printinformation(); m.out() << "===============" << endl << "Problem name : " << problem << endl // nama permasalahan << "Cost : " <<plan.gettotalcost()+1000*plan.getnbofvehiclesused()<< endl //biaya total << "Number of vehicles used : "<< plan.getnbofvehiclesused() << endl// kendaraan yang digunakan << "Solution : " << endl //gambaran solusi yang dihasilkan << plan << endl; } int main(int argc, char* argv[]) { IlcManager m(ilcedit); #if defined(ilclogfile) m.openlogfile("vrp.log"); #endif IlcRoutingPlan plan(m); // definisikan permasalahan yang dihadapi IlcDimension2 time(plan, IlcEuclidean, "Time"); IlcDimension1 weight(plan, "Weight"); // definisikan kapasitas yang dibawa kendaraan IlcDimension2 length(plan, IlcEuclidean, "Length"); ////////////////////////////////////////////////////////////////// // membaca data dari file vrp20_1_1_1.dat ////////////////////////////////////////////////////////////////// ifstream infile; char * problem; if (argc >=2) problem = argv[1]; else problem = (char *) "E:/ta/prognya/code/coba/vrp/cost on vehicle/vrp20_1_1_1.dat"; infile.open(problem); if (!infile) { m.out() << "File not found or not specified: " << problem << endl; #if defined(ilclogfile) m.closelogfile(); #endif m.end(); return 0; } IlcInt nbofvisits, nboftrucks; infile >> nbofvisits >> nboftrucks;

12 27 IlcFloat capacity; infile >> capacity; IlcFloat opentime, closetime; infile >> opentime >> closetime; IlcFloat depotx, depoty ; infile >> depotx >> depoty; IlcNode depot(plan, depotx, depoty); for (IlcInt j = 0; j < nboftrucks; j++) { IlcVisit first(depot, "Depot"); // dimulai dari depot m.add(first.getcumulvar(time) >= opentime); // definisikan waktu buka IlcVisit last(depot, "Depot"); // diakhiri di depot m.add(last.getcumulvar(time) <= closetime); // definisikan waktu tutup char name[16]; sprintf(name, "Vehicle %d\0", j); // kendaraan yang melakukan pengiriman IlcVehicle vehicle(plan, first, last, name); vehicle.setcapacity(weight, capacity); // kendala kapasitas kendaraan vehicle.setspeed(length, 1); } for (IlcInt i = 0; i < nbofvisits; i++) { IlcInt id; // visit identifier?? IlcFloat x, y, quantity, mintime, maxtime, droptime; infile >> id >> quantity >> mintime >> maxtime >> droptime >> x >> y; IlcNode customer(plan, x, y); char name[16]; sprintf(name, "%d\0", id); IlcVisit visit(customer, name); visit.setdelay(time, droptime); //kendala waktu bongkar-muat visit.setquantity(weight, quantity);// kendala yang dibawa kendaraan /////////////////////////////////////////////// // kendala waktu pelayanan (time window) /////////////////////////////////////////////// ILCSETWINDOW(visit.getCumulVar(time), mintime <= var && var <= maxtime); } infile.close(); ///////////////////////////////////////////////////////////////////////// // mencari solusi dengan menggunakan metode nearest addition heuristic ///////////////////////////////////////////////////////////////////////// IlcGoal generategoal = IlcNearestAdditionGenerate(m, plan); m.add(generategoal); if (!m.nextsolution()) { m.out() << "Not enough vehicles to generate first solution" << endl; #if defined(ilclogfile) m.closelogfile(); #endif m.end(); return 0; } else { m.restart(); m.remove(generategoal); ////////////////////////////////////////////////////////////////////////////////// //memperbaiki solusi yang didapat dengan twoop,oropt,relocate,exchange,dan Cross ////////////////////////////////////////////////////////////////////////////////// plan.improve(5, IlcTwoOpt(plan), IlcOrOpt(plan), IlcRelocate(plan), IlcExchange(plan),

13 28 IlcCross(plan)); } Info(m, plan, problem); #if defined(ilclogfile) m.closelogfile(); #endif m.end(); return 0; }

14 29 Lampiran 9 Output Problem name: cost: Number of vehicles used: 3 Solution: Unperform visits: None Vehicle 0: Depot Weight [0..166] Time [ ] Length [0..1.#INF] 1 Weight [0..166] Time [ ] Length [ #INF] 4 Weight [ ] Time [ ] Length [ #INF] Depot Weight [ ] Time [ ] Length [ #INF] Vehicle 1: Depot Weight [0..47] Time [ ] Length [0..1.#INF] 3 Weight [0..47] Time [ ] Length [ #INF] 5 Weight [7..54] Time [ ] Length [ #INF] 2 Weight [15..62] Time [ ] Length [ #INF] 11 Weight [18..65] Time [ ] Length [ #INF] 12 Weight [ ] Time [ ] Length [ #INF] 13 Weight [ ] Time [ ] Length [ #INF] 15 Weight [ ] Time [ ] Length [ #INF] 22 Weight [ ] Time [ ] Length [ #INF] 23 Weight [ ] Time [ ] Length [ #INF] 6 Weight [ ] Time [ ] Length [ #INF] Depot Weight[ ] Time [ ] Length [ #INF] Vehicle 2: Depot Weight [0..6] Time [ ] Length [0..1.#INF] 09 Weight [0..6] Time [ ] Length [ #INF] 08 Weight [2..8] Time [ ] Length [ #INF] 07 Weight [19..25] Time [ ] Length [ #INF] 10 Weight [38..44] Time [ ] Length [ #INF] 14 Weight [ ] Time[ ] Length [ #INF] 16 Weight [79..85] Time [ ] Length [ #INF] 17 Weight [88..94] Time [ ] Length [ #INF] 24 Weight [92..98] Time [ ] Length [ #INF] 21 Weight [ ] Time [ ] Length [ #INF] 20 Weight [ ] Time [ ] Length [ #INF] 19 Weight [ ] Time [ ] Length [ #INF] 18 Weight [ ] Time [ ] Length [ #INF] Depot Weight[ ] Time [ ] Length [ #INF]

15 30 Lampiran 10 Contoh dari metode multidimensional scaling (MDS): Input: D = X Atl Chi Den Hou LA Mia NYC SF Sea WDC Atl Chi Den Hou LA Mia NYC SF Sea WDC Matriks jarak antara 10 kota di Amerika Serikat Ouput yang dihasilkan: Output Multidimensional Scaling (MATLAB, 2004)