Perbandingan metode Average Total Opportunity Cost, Improve Least Cost, dan Best Candidate untuk menyelesaikan masalah transportasi

Bahaudin, Bahaudin (2018) Perbandingan metode Average Total Opportunity Cost, Improve Least Cost, dan Best Candidate untuk menyelesaikan masalah transportasi. Diploma thesis, UIN Sunan Gunung Djati Bandung.

Preview	Text (COVER) 1_cover.pdf Download (35kB) | Preview
Preview	Text (ABSTRAK) 2_abstrak.pdf Download (103kB) | Preview
Preview	Text (DAFTAR ISI) 3_daftarisi.pdf Download (126kB) | Preview
Preview	Text (BAB I) 4_bab1.pdf Download (381kB) | Preview
	Text (BAB II) 5_bab2.pdf Restricted to Registered users only Download (621kB) | Request a copy
	Text (BAB III) 6_bab3.pdf Restricted to Registered users only Download (326kB) | Request a copy
	Text (BAB IV) 7_bab4.pdf Restricted to Registered users only Download (2MB) | Request a copy
	Text (BAB V) 8_bab5.pdf Restricted to Registered users only Download (278kB) | Request a copy
	Text (DAFTAR PUSTAKA) 9_daftarpustaka.pdf Restricted to Registered users only Download (106kB) | Request a copy

Abstract

Metode average total opportunity cost, metode improve least cost dan metode best candidate adalah metode minimasi biaya transportasi. Metode average total opportunity cost membagi algoritma average total opportunity cost menjadi dua tahap yaitu tahap algoritma total opportunity cost table dan tahap algoritma alokasi transportasi. Metode improve least cost memiliki tahapan penting yaitu menentukan nilai biaya transportasi terkecil disetiap iterasi. Metode best candidate menentukan hasil terkecil dari kombinasi candidate-candidate yang diperoleh, nilai candidate diambil dari dua biaya terkecil tiap baris. Tugas akhir ini bertujuan untuk melihat metode manakah yang paling banyak menghasilkan output terkecil dari ketiga metode tersebut, hasil yang diperoleh memperlihatkan bahwa metode average total opportunity cost lebih baik dari metode improve least cost dan metode best candidate pada kasus masalah transportasi seimbang, sedangkan pada kasus masalah transportasi tidak seimbang metode improve least cost dan metode best candidate lebih baik dari metode average total opportunity cost. The method of average total opportunity cost, improve least cost method and best candidate method are methods that minimize transportation costs. The average total opportunity cost method divides the average total opportunity cost algorithm into two stages, namely the total opportunity cost table algorithm and the transportation allocation algorithm stage. The improve least cost method has an important step that is determining the value of the smallest transportation costs in each iteration. The best candidate method determines the smallest result of the combination of candidates obtained, the candidate value is taken from the two smallest costs per line. This study aims to see which method produces the smallest output of the three methods, the results obtained show that the average total opportunity cost method is better than the improve least cost method and the best candidate method in the case of balanced transportation problems, while in the case of transportation problems unbalanced method improve least cost and best candidate method is better than the average total opportunity cost method.

Actions (login required)

View Item