Rizkiani, Firda Nur (2021) Maritime Inventory Routing Problem with Undedicated Compartments: A Case Study of an Indonesia Cement Company. Masters thesis, Institut Teknologi Sepuluh Nopember.
Preview |
Text
02411950020002-Master_Thesis.pdf - Accepted Version Download (2MB) | Preview |
Abstract
A major cement producer's maritime inventory routing problem is to satisfy the demand at different ports during the planning horizon. A heterogeneous fleet of bulk ships with undedicated compartments transport multiple non-mixable cement products from production port to consumption ports along across several islands. Inventory constraints are present both at the production and the consumption ports, and there are upper and lower limits for all inventories. Besides, constraints regarding the capacity of the ship's compartment hold, the port's depth, and the fact that different products cannot be mixed must be considered. The problem's objective is to find a minimum transportation cost solution while satisfying several technical and physical constraints within a given planning horizon. To solve this problem, first, a mixed-integer linear programming model is presented considering various scheduling and routing constraints, loading or unloading constraints, and ship selection and capacity constraints. Considering the difficulty of solving large problems and the NP-hard nature of the model, we combine the previously introduced MILP formulation with a metaheuristic approach to solve the problem called Genetic Algorithm. The proposed model is validated against MILP solution using AMPL for several problem instances. Besides, we implement this proposed model to solve the real problem faced by a cement company in Indonesia to satisfy the needs at the consumption ports during the given planning horizon with good quality solutions within reasonable solution time.
======================================================================================================
Permasalahan utama yang dimiliki produsen semen dalam pengelolaan
rute maritim dan persediaan adalah untuk memenuhi permintaan di berbagai
pelabuhan selama waktu perencanaan. Kapal heterogen dengan undedicated
compartment digunakan untuk mengangkut beberapa produk jenis semen yang
tidak dapat dicampur dari pelabuhan produksi ke pelabuhan konsumsi yang
terletak di beberapa pulau. Setiap pelabuhan produksi dan konsumsi memiliki
kapasitas penyimpanan tertentu. Selain itu, terdapat kapasitas kompartemen pada
kapal, kedalaman pelabuhan, dan jenis produk semen yang berbeda tidak dapat
dicampur kedalam kompartemen yang sama harus dipertimbangkan. Tujuan dari
permasalahan ini adalah untuk meminimalkan biaya transportasi dan memenuhi
beberapa kendala teknis dan fisik selama waktu perencanaan. Mixed-integer
linear programming model digunakan untuk menyelesaikan kendala penjadwalan
dan rute, loading atau unloading, dan pemilihan kapal. Dengan
mempertimbangkan kesulitan dalam menyelesaikan masalah besar dan NP-hard
model, penggabungan formulasi MILP dengan pendekatan metaheuristik yaitu
Genetic Algorithm. Model yang diusulkan dan divalidasi terhadap solusi MILP
menggunakan AMPL untuk beberapa problem instances. Selain itu, penulis
menerapkan model yang diusulkan untuk menyelesaikan masalah nyata yang
dihadapi oleh perusahaan semen di Indonesia untuk memenuhi kebutuhan selama
waktu perencanaan dengan solusi yang berkualitas baik dan waktu yang wajar.
| Item Type: | Thesis (Masters) |
|---|---|
| Uncontrolled Keywords: | Inventory Routing Problem, Transportasi Maritim, Undedicated Compartments, Metaheuristik |
| Subjects: | H Social Sciences > HE Transportation and Communications > HE336.R68 Route choice H Social Sciences > HE Transportation and Communications > HE566.S3 Sailing ships |
| Divisions: | Faculty of Industrial Technology > Industrial Engineering > 26101-(S2) Master Thesis |
| Depositing User: | Firda Nur Rizkiani |
| Date Deposited: | 23 Aug 2021 14:16 |
| Last Modified: | 15 Jul 2024 12:38 |
| URI: | http://repository.its.ac.id/id/eprint/89039 |
Actions (login required)
 |
View Item |