Pengembangan Model And Algoritma Untuk Menyelesaikan Multi-Product Inventory Ship Routing Problem Dengan Dedicated Tanker Fleet

Raydika, Muhammad Erza (2016) Pengembangan Model And Algoritma Untuk Menyelesaikan Multi-Product Inventory Ship Routing Problem Dengan Dedicated Tanker Fleet. Undergraduate thesis, Institut Teknologi Sepuluh Nopember.

[thumbnail of 2512100065-Undergraduate_Thesis.pdf]
Preview
Text
2512100065-Undergraduate_Thesis.pdf - Accepted Version

Download (1MB) | Preview

Abstract

Kapal tanker banyak digunakan oleh banyak perusahaan sebagai salah satu moda transporasi untuk mengirimkan produknya. Untuk mencapai efisiensi yang tinggi dalam distribusi produk, diperlukan sebuah studi yang komprehensif tentang distribusi produk, dan salah satunya adalah Inventory Routing Problem. Melihat permasalah yang ada, penelitian ini bertujuan untuk membuat model dan algoritma untuk multi-product inventory routing problem dengan dedicated tanker fleet. Model yang dibuat mampu mengakomodasi multi product, multi depot, dedicated tanker policy, dan titik awal kapal yang fleksibel. Beberapa constraints dalam penelitian ini antara lain routing, inventori, waktu, loading dan unloading dengan objective function minimasi total biaya. Algoritma yang dikembangkan terdiri dari tiga bagian penting yaitu mengitung dan menyortir pelabuhan kritis, pemilihan kapal, dan proses routing. Kemudian, model yang algoritma tadi deprogram dengan menggunakan VBA di Microsoft Excel 2013 yang akan menghasilkan detail rute dari tiap kapal, waktu rute, dan biaya yang dikeluarkan. Hasil dari penelitian ini adalah program yang digunakan mampu menyelesaikan multi-product inventory ship routing problem. Dari beberapa eksperimen numerik didapat hasil jumlah kapal tanker terbaik untuk skema simulasi tertentu adalah 9 kapal tanker.
=============================================================================================================
Many companies use tanker as one of the transportation mode to deliver their products. In order to reach optimum level and high efficiency of product distribution, a comprehensive study regarding distribution is important. In the literature, it is called Inventory Routing Problem (IRP). Based on a real case of oil distribution using tanker fleet in an Indonesian state-owned oil company, this research develops a model and algorithms to solve a Multi-Product Inventory Ship Routing Problem (M-ISRP) for dedicated tanker fleet. The model accommodates some aspects including multi products, multi depots, and flexible tanker initial points. The objective function is to minimize total distribution costs considering some constraints such as inventory, time, loading and unloading. The algorithms built consists of three main modules, which are critical ports selection, ship assignment, and ship routing. A spreadsheet-based decision support tool have been developed to evaluate the proposed algorithms. The results of the numerical experiments showed that the best total tanker number to deliver all the demand on certain case is 9 tankers.

Item Type: Thesis (Undergraduate)
Additional Information: RSI 658.787 Ray d
Uncontrolled Keywords: Heuristic, Inventory Ship Routing Problem, Pengembangan Model, Vehicle Routing Problem, Vendor Managed Inventory.
Subjects: H Social Sciences > HD Industries. Land use. Labor > HD55 Inventory control
Divisions: Faculty of Industrial Technology > Industrial Engineering > 26201-(S1) Undergraduate Thesis
Depositing User: Yeni Anita Gonti
Date Deposited: 07 Apr 2020 14:21
Last Modified: 07 Apr 2020 14:21
URI: http://repository.its.ac.id/id/eprint/75711

Actions (login required)

View Item View Item