Yaqin, Muhammad Ainul (2021) Penentuan Keputusan Operasional Distribusi Gas Menggunakan Metode Large Neighbourhood Search (Studi Kasus: Perusahaan Produsen Dan Distributor Gas). Undergraduate thesis, Institut Teknologi Sepuluh Nopember.
![[thumbnail of 02411740000154_Undergraduate_Thesis.pdf]](http://repository.its.ac.id/style/images/fileicons/text.png) |
Text
02411740000154_Undergraduate_Thesis.pdf - Accepted Version Download (6MB) |
Abstract
PT X selaku produsen dan distributor gas industri (Oksigen, Nitrogen, Argon), gas spesial (hidrogen, karbondioksida, asitilin) dan gas campuran (Arco, Arsil) memiliki kendala dalam melakukan operasional distribusi gas. Salah satu kegiatan distribusi yang terkendala yakni pada proses pengiriman dan penarikan tabung gas dari pelanggan. Saat ini, proses distribusi dilakukan dengan tujuh armada truk. PT. X memiliki kendala dalam melakukan penugasan dan penjadwalan untuk setiap truk karena masih menggunakan metode konvensional, sehingga terjadi pembengkakan biaya. Di sisi lain, PT. X ingin melakukan efisiensi jumlah armada yang digunakan. Pendekatan dari penyelesaian permasalahan Capacitated Vehicle Routing Problem Time Windows with Delivery Pickup (CVRPTW With DP) dapat dijadikan acuan karena dalam proses distribusi, perusahaan memiliki batasan pada kapasitas, waktu kerja, dan jumlah muatan kendaraan. Oleh sebab itu guna menyelesaikan permasalahan maka akan dilakukan penyelesaian menggunakan algoritma Large Neighbourhood Search (LNS) Heuristik dengan bantuan Visual Basic for Application (VBA) untuk mencari solusi. Hasil yang didapatkan dari penggunaan algoritma Large Neighbourhood Search (LNS) Heuristik dibanding kondisi eksisting perusahaan adalah efisiensi biaya hingga 23,16%, efisiensi Jarak Tempuh hingga 32,25%, dan memaksimalkan jumlah armada yang dimiliki menjadi 5 armada. Hasil penelitian ini dapat dijadikan pertimbangan dan digunakan perusahaan dalam melakukan proses distribusi harian.
=======================================================================================================
PT X as a producer and distributor of industrial gases (Oxygen, Nitrogen, Argon),
special gases (hydrogen, carbon dioxide, acetylene) and mixed gases (Arco, Arsil)
has problems in gas distribution. One of the distribution activities that are
constrained is the delivery and pick-up of gas cylinders from customers. Currently,
the distribution process is carried out with seven trucks. PT. X has problems in
assignment and scheduling of each fleets because it still uses conventional methods,
thus causing cost overruns. On the other hand, PT. X wants to make efficiency in
the number of fleets used. The approach of solving the Capacitated Vehicle Routing
Problem Time Windows with Delivery Pickup (CVRPTW With DP) can be used
as a reference because in the distribution process, the company has limitations on
capacity, working time, and the number of vehicle loads. Therefore, in order to
solve the problem, a Solusi will be carried out using the Large Neighborhood Search
Heuristic (LNS) algorithm with the help of Visual Basic for Application (VBA) to
find a Solusi. The results obtained from the use of the Large Neighborhood Search
(LNS) Heuristic algorithm compared to the company's existing conditions are cost
efficiency more than 23.16%, mileage efficiency more than 32.25%, and
maximizing the number of fleets owned to 5 fleets. The results of this study can be
taken into consideration and used by the company in the daily distribution process.
| Item Type: | Thesis (Undergraduate) |
|---|---|
| Uncontrolled Keywords: | Assigment and Scheduling, Cost and Mileage Efficiency, CVRPTW with DP, LNS Heuristic Algorithm,Algoritma LNS Heuristik, CVRPTW with DP, Efisiensi Biaya dan Jarak Tempuh, Penugasan dan Penjadwalan |
| Subjects: | H Social Sciences > HD Industries. Land use. Labor > HD30.23 Decision making. Business requirements analysis. H Social Sciences > HD Industries. Land use. Labor > HD38.5 Business logistics--Cost effectiveness. Supply chain management. ERP T Technology > T Technology (General) > T57.84 Heuristic algorithms. |
| Divisions: | Faculty of Industrial Technology and Systems Engineering (INDSYS) > Industrial Engineering > 26201-(S1) Undergraduate Thesis |
| Depositing User: | Muhammad Ainul Yaqin |
| Date Deposited: | 04 Aug 2021 03:27 |
| Last Modified: | 06 Jun 2024 05:32 |
| URI: | http://repository.its.ac.id/id/eprint/84782 |
Actions (login required)
 |
View Item |