Article Per Year (5 Year)
p-Index From 2021 - 2026
0.817
P-Index
This Author published in this journals
All Journal Jurnal Teknik Industri JURNAL ITENAS REKAYASA REKA INTEGRA Jurnal Ilmiah Teknik Industri JRSI (Jurnal Rekayasa Sistem dan Industri) JURNAL REKAYASA SISTEM INDUSTRI Jurnal Rekayasa Hijau Jurnal Sistem Teknik Industri REKA ELKOMIKA: Jurnal Pengabdian kepada Masyarakat Jurnal Optimasi Teknik Industri (JOTI)
Arif Imran
Institut Teknologi Nasional Bandung
Agriculture, Biological Sciences & Forestry Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Earth & Planetary Sciences Economics, Econometrics & Finance Education Electrical & Electronics Engineering Engineering Industrial & Manufacturing Engineering Materials Science & Nanotechnology Mechanical Engineering

Published : 38 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 38 Documents
Search

 1   2   3   4 
PENENTUAN RUTE DISTRIBUSI UNTUK MINIMASI BIAYA DISTRIBUSI TEH WALINI READY TO DRINK DI PT PERKEBUNAN NUSANTARA VIII (PERSERO) Amanda, Muhammad Abell; Imran, Arif; Prassetiyo, Hendro
REKA INTEGRA Vol 3, No 1 (2015): Edisi Kesembilan
Publisher : REKA INTEGRA

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (713.997 KB)

Abstract

Penelitian ini membahas pencarian rute distribusi untuk produk dari Industri Hilir Teh PT Perkebunan Nusantara VIII (Persero). Metode savings matrix digunakan untuk menghitung penghematan rute distribusi. Algoritma nearest insert dan algoritma nearest neighbor digunakan untuk mendapatkan urutan rute distribusi. Urutan rute distribusi yang telah diperoleh akan diperbaiki oleh the-1 insertion intra-route procedure. Hasil dari perhitungan menunjukkan bahwa penggunaan the-1 insertion intra-route procedure menghasilkan total rute distribusi yang lebih baik dari pada hasil rute menggunakan algoritma nearest insert dan nearest neighbor, dan dapat digunakan sebagai rute distribusi produk Industri Hilir Teh PT Perkebunan Nusantara VIII (Persero).   Kata kunci : Savings matrix, nearest insert, nearest neighbor, the 1-insertion intra-route procedure.   ABSTRACT This paper discuss how to get the distribution route for product of Industri Hilir Teh PT Perkebunan Nusantara VIII (Persero). Savings matrix method is used to calculate route savings. The nearest insert algorithm and nearest neighbor algorithm are applied to obtain the distribution routes. The obtained routes are then improved using the 1-insertion intra-route procedure. The result shows that the 1-insertion intra-route procedure produce shorter total route than total route of nearest insert and nearest neighbor algorithm, and can be use for the distribution route of Industri Hilir Teh PT Perkebunan Nusantara VIII (Persero). Keywords : Savings matrix, nearest insert, nearest neighbor, the 1-insertion intra-route procedure
Software Design using Visual Basic for Application and Microsoft Excel Programming for Students Ramadhan, Fadillah; Rukmi, Hendang Setyo; Imran, Arif; Nugraha, Cahyadi; Ferdiansyah, Risdan
REKA ELKOMIKA: Jurnal Pengabdian kepada Masyarakat Vol 1, No 2 (2020): REKA ELKOMIKA
Publisher : Institut Teknologi Nasional, Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26760/rekaelkomika.v1i2.86-97

Abstract

The rapid development of information technology has made people to have the ability to design software with a programming language. There are quite some engineers who have not mastered programming languages. It happens becausesome people think that developing software with a certain programming language is very difficult. The language is difficult to understand, the accuracy must be precise, and the user is not familiar with the platform. Difficulty in learning programming languages is a problem that is often encountered by university students, vocational students, or employees. This article describes an easy programming language training activity for beginners, namelyVisual Basic for Applications (VBA)-Ms. Excel training.The advantage of this programming language iseasy to operate because manystudentsor employees are very familiar with Ms. Excel so that the adaptation process will be easy. The results of the post-test training that was attended bystudents showed a significant increase in the ability to design programming languages.
Value Co-Creation Model of Halal Logistics Services Liane Okdinawati; Togar M. Simatupang; Arif Imran; Yuliani Dwi Lestari
Jurnal Ilmiah Teknik Industri Vol. 20, No. 1, June 2021
Publisher : Department of Industrial Engineering Universitas Muhammadiyah Surakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23917/jiti.v20i1.13028

Abstract

Increasing consumer awareness to provide halal assurance in the supply chain process happens in Muslim countries and non-Muslim countries. Kosher products become a symbol for food safety, quality assurance, and lifestyle choice due to the strict requirements, thereby reducing the risk of contamination of the disease. This led to the increase of demands of halal logistics services to implement the halal concepts in logistics processes. One of the obstacles faced by the companies is a lack of understanding of how the halal concept is applied in accordance with the role of each company in the supply chain. This paper illustrates the value co-creation model using several supply chains for Fast-moving consumer goods (FMCG), cosmetics, fashion, and pharmaceuticals to provide value for customers and all parties that guarantee halal concepts throughout the activities of the supply chains. Business model and the adaptation in operational planning for a transportation company as halal logistics services are also developed in this paper by including segregation process, packaging, cleaning process, halal labeling, and halal documentation to ensure standard halal assurance are distinguished from activities in the general logistics process.
USULAN RUTE DISTRIBUSI MENGGUNAKAN ALGORITMA SWEEP DAN LOCAL SEARCH (STUDI KASUS DI PERUSAHAAN X) Muhamad Ruben; Arif Imran
JURNAL REKAYASA SISTEM INDUSTRI Vol 6 No 1 (2020): (November 2020)
Publisher : Universitas Putera Batam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33884/jrsi.v6i1.2491

Abstract

A company has to deliver its product to thirty-five points/customers. In delivering process, there are limitations such as the number of vehicles, vehicle capacity, and driver's working hours. The company wants to find a better/shorter route in distributing its product to customer in order to minimize the transportation cost. The problem can considered as the Capacited Vehicle Routing Problem. In this paper, the Sweep algorithm are first used to find the initial solution. The local search procedures are used to the solution obtained by the Sweep algorithm. Four local searches are applied, 1-insertion intra-route, 1- insertion inter-route, 1-1 intra –route and 1-1 inter-route. The solutions produced by each local search are then compared, and the best one is selected. The best solution is given by the 1-Insertion intra-route procedure. It is 27,923 km shorter (15% better) than the current routes.
Penentuan Rute Distribusi Menggunakan Metode Savings Matrix, Nearest Neighbor, dan 2-Opt pada CV X Ferdi Prabowo; Arif Imran; Hendro Prassetiyo
Jurnal Optimasi Teknik Industri (JOTI) Vol 5, No 2 (2023)
Publisher : Teknik Industri Universitas Indraprasta PGRI

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30998/joti.v5i2.15620

Abstract

CV X merupakan perusahaan yang memproduksi kemeja. Produk tersebut didistribusikan ke 26 toko yang terdapat di Kota Bandung. Proses pendistribusiannya masih dilakukan berdasarkan perkiraan driver saja tanpa memperhatikan banyaknya permintaan dari setiap toko dan kapasitas alat angkut yang dimiliki perusahaan. Cara pengiriman tersebut mengakibatkan barang yang dikirim sering mengalami keterlambatan. Permasalahan yang dihadapi perusahaan ini dikenal juga sebagai Capacitated Vehicle Routing Problem (CVRP). Pada penelitian ini diusulkan metode savings matrix, nearest neighbor, dan 2-opt untuk mendapatkan rute distribusi yang lebih baik sehingga keterlambatan dapat dikurangi atau dihilangkan. Berdasarkan hasil perhitungan, diperoleh total jarak sebesar 158,21 km dengan waktu 478 menit, sedangkan awalnya total jarak 190,41 km dan waktu 588 menit. Besarnya penghematan jarak yang didapat yaitu sebesar 16,911% atau dapat menghemat total jarak tempuh sebesar 32,2 km.
A Simulated Annealing for Heterogenous Fleet Vehicle Routing Problem with Multiple Trips and Pickup-Delivery Firda Nur Rizkiani; Rosmala Sari; Arif Imran
Rekayasa Hijau : Jurnal Teknologi Ramah Lingkungan Vol 7, No 3 (2023)
Publisher : Institut Teknologi Nasional, Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26760/jrh.v7i3.277-288

Abstract

ABSTRAKSalah satu masalah paling krusial dalam Supply Chain Management (SCM) adalah perancangan jaringan distribusi yang secara signifikan memengaruhi biaya total. Salah satu masalah umum dalam distribusi adalah bagaimana merancang rute kendaraan yang optimal. Masalah ini dikenal sebagai Vehicle Routing Problem (VRP). Sebuah variasi VRP yang dikenal sebagai Heterogeneous Fleet Vehicle Routing Problem with Multiple Trips and Pickup and Delivery (HFVRPMTPD) memiliki karakteristik berikut: jenis kendaraan yang berbeda, perjalanan ganda, dan pengambilan serta pengantaran secara simultan. Penelitian ini membantu dalam menyelesaikan masalah yang dihadapi oleh Perusahaan Distribusi Liquefied Petroleum Gas (LPG) yang mengantarkan dan mengumpulkan tabung gas secara simultan dengan menggunakan jenis kendaraan yang berbeda-beda dan dapat melakukan perjalanan ganda sepanjang waktu operasi. Saat ini, perencanaan rute hanya didasarkan pada pengalaman pengemudi, yang mengakibatkan peningkatan jarak total, dan akhirnya mengarah pada waktu pengiriman yang tidak efisien. Peneliti mengusulkan pendekatan Simulated Annealing (SA) dengan menggunakan Savings Matrix dan Nearest Neighbor untuk mendapatkan solusi awal, dengan tujuan meminimalkan jarak total. Hasil penelitian menunjukkan bahwa rute yang diusulkan memberikan solusi yang lebih baik dalam hal jarak total dibandingkan dengan solusi saat ini dari perusahaan. Analisis sensitivitas terhadap parameter SA juga dilakukan untuk menilai kinerja algoritma yang diusulkan.Kata kunci: Jaringan Distribusi, Vehicle Routing Problem, Heterogeneous Fleet Vehicle Routing Problem with Multiple Trips and Pickup and Delivery, Savings Matrix, Nearest Neighbor, Simulated Annealing ABSTRACT One of the most critical issues in Supply Chain Management (SCM) is the design of distribution networks that substantially affects the total cost. Designing optimal vehicle route plan is the most common issue in distribution. This problem is known as Vehicle Routing Problem (VRP). A VRP variant known as Heterogeneous Fleet Vehicle Routing Problem with Multiple Trips and Pickup and Delivery (HFVRPMTPD) involves the following characteristics: heterogenous vehicles, multiple trips, and simultaneous pickup and delivery. This research helps to solve the problems encountered by a Liquefied Petroleum Gas (LPG) Distribution Company which operates by delivering and collecting simultaneously the gas cylinders using heterogenous vehicle in multiple trips throughout the operation time. Currently, the route planning is solely based on the driver’s experience, resulting in increased total distance, and consequently leading to inefficient delivery times. We propose a Simulated Annealing (SA) with the initial solution obtained using Saving Matrix and Nearest Neighbor, aiming at minimizing the total distance. The results indicate that the proposed route provides a better solution in terms of total distance compared to the current solution of the company. Sensitivity analyses of the SA parameter are also conducted to assess the proposed algorithm’s performance.Keywords: Distribution Networks, Heterogeneous Fleet Vehicle Routing Problem with Multiple Trips and Pickup and Delivery, Savings Matrix, Nearest Neighbor, Simulated Annealing
Efficient Route Planning for Flour Distribution: A Heuristic Approach Baisa, Said Muhammad; Imran, Arif; Maulana, Hilman; Afifah, Alif Ulfa
Jurnal Sistem Teknik Industri Vol. 26 No. 2 (2024): JSTI Volume 26 Number 2 July 2024
Publisher : TALENTA Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32734/jsti.v26i2.17223

Abstract

This company operates in the Food and Beverage sector, selling Martabak, an Indonesian snack. The company needs to deliver flour to 25 branches spread across Bandung, Indonesia, every day, with varying demand capacities at each branch. Each day, the total amount of flour to be delivered is 377 boxes. Currently, the company has 12 distribution routes with a total distance of 271,16 km, with each route covering only two stores. However, these routes are too many and vehicle capacities need to be optimized, resulting in a high total travelled distance. The aim of this research is to optimize the delivery routes to reduce the total travelled distance and number of routes. To address this issue, known as the Vehicle Routing Problem (VRP), heuristic methods were employed, specifically the nearest neighbour method for initial route construction and Intra-Route (1-0) Insertion for improvement. Implementing these heuristic methods resulted in a final total of 6 distribution routes with a total distance of 160,90 km. This method successfully reduced the total travelled distance by 110,26 km and reduced the number of routes by 6. In conclusion, the application of heuristic methods in solving the VRP for this company proved to be effective in reducing both the total travelled distance and the number of routes, thereby enhancing the operational efficiency of the delivery process.
Penentuan Rute Dan Jumlah Kendaraan Pada Kasus School Bus Routing Problem: Penerapan Algoritma Record-to-record Travel Ramadhan, Fadillah; Imran, Arif
Jurnal Rekayasa Sistem & Industri Vol 5 No 01 (2018): Jurnal Rekayasa Sistem & Industri - Juni 2018 (In Press)
Publisher : School of Industrial and System Engineering, Telkom University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25124/jrsi.v5i01.307

Abstract

Program bus sekolah gratis merupakan salah satu program yang sedang dikembangkan untuk menunjang kemajuan pendidikan. Penentuan rute dan jumlah bus sekolah yang dapat meminimumkan biaya perjalanan dan pengadaan kendaran merupakan aspek penting dalam menerapkan program bus sekolah tersebut. Penelitian ini membangun algoritma dan program perangkat lunak untuk model school bus routing problem (SBRP) yang dapat meminimisasi biaya perjalanan dan biaya investasi jumlah kendaraan bus. Algoritma record-to-record travel digunakan untuk mendapatkan solusi yang baik dengan waktu komputasi yang relatif cepat pada program perangkat lunak yang dibangun. Karakteristik model SBRP pada penelitian ini, bus memiliki kapasitas terbatas dan homogen, titik awal bus berada di depot, lalu mendatangi beberapa halte dimana setiap halte memiliki jumlah penumpang yang deterministik. Setelah mendatangi halte terakhir, bus akan mendatangi halte dengan arah kebalikannya yang diakhiri di titik awal (depot). Program bus sekolah gratis di Kota Bandung dijadikan objek penelitian mengingat program tersebut sedang diterapkan dan dievaluasi untuk meningkatkan efektivitas penggunaannya. Hasil yang didapatkan pada penelitian ini, model SBRP dan algoritma record-to-record travel yang dibangun dan diujikan pada kasus bus sekolah di Kota Bandung memperlihatkan solusi yang layak dan baik. Proses pengelompokkan bus per wilayah Kota Bandung dapat dihasilkan dan menunjukkan biaya perjalanan dan biaya investasi pengadaan kendaraan bus yang minimum. Selain itu, algoritma ini terbukti dapat menyelesaikan permasalahan SBRP dengan waktu komputasi yang cepat, yaitu dibawah 10 detik.
Co-Authors Adhie Nurdiansyah Pamungkas Afifah, Alif Ulfa Alex Saleh Alfian Suyudi, Alfian Ali Mukhsinin Ardhi Rahman Fauzi Bagus Dwicahyo Dewantoro Baisa, Said Muhammad Cahyadi Nugraha CLAUDYA SANIN HUTASOIT Danang Rahadian DZIKRI ARBAWAN RAHMATULLAH EMILIANA HOSTYA R. BENGE Emsosfi Zaini Fadillah Ramadhan Fatharani Arinalhaq Ferdi Prabowo Ferdiansyah, Risdan Firda Nur Rizkiani Habdhi Verdi Usman Hari Adianto Hartika Yoza Hendang Setyo Rukmi Hendro Prassetiyo Hilman Maulana Kenno Prasetyo Khairan Adi Putra KHARIZA SYAILANDRA Liane Okdinawati LIANE OKDINAWATI, LIANE Lisye Fitria LITA OCTORA MALINDA MULYAWATI UTOMO Martino Luis MOCHAMAD IQBAL NASHRULHAQ Muhamad Ruben Muhammad Abell Amanda Renita Yuniar Ronald Adjie K Situmorang, Ronald Adjie K Rosmala Sari SASHA AZIZA SATRIA MEGANTARA ROHANDI Sekartyasto, Dio Rizcki Septa Hardini SEPTIANI HARTINI Susy Susanty Syah Tjaja, Arief Irfan Tika Agustin Togar M. Simatupang Yoni Adityo Respati Yuliani Dwi Lestari