Article Per Year (5 Year)
p-Index From 2019 - 2024
1.203
P-Index
This Author published in this journals
All Journal Jurnal Teknik Industri 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 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 Industrial & Manufacturing Engineering Materials Science & Nanotechnology Mechanical Engineering

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

Found 2 Documents
Search
Journal : JURNAL ITENAS REKAYASA

 1 
An Application of the Multi-Level Heuristic for the Heterogeneous Fleet Vehicle Routing Problem Imran, Arif
JURNAL ITENAS REKAYASA Vol 14, No 1 (2010)
Publisher : Jurnal ITENAS Rekayasa

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

Abstract

ABSTRACTThe Multi-Level heuristic is used to investigate the heterogeneous fleet vehicle routing problem (HFVRP). The initial solution for the Multi-Level heuristic is obtained by Dijkstra’s algorithm based on a cost network constructed by the sweep algorithm and the 2-opt procedure. The proposed algorithm uses a number of local search operators such as swap, 1-0 insertion, 2-opt, and Dijkstra’s Algorithm. In addition, in order to improve the search process, a diversification procedure is applied. The proposed algorithm is thentested on the data sets from the literature.Keywords: multi-level, heuristic, routing, heterogeneous fleet  ABSTRAKAlgoritma Multi-Level heuristic digunakan untuk melakukan investigasi terhadap heterogeneous fleet vehicle routing problem (HFVRP). Solusi inisial Multi-Level heuristic didapatkan dari algoritma Dijkstra berdasarkan cost network yang dibentukoleh agoritma sweep dan prosedur 2-opt. Algoritma Multi-Level heuristic yang dikembangkan memakai sejumlah operator local search seperti, swap, 1-0 insertion, 2-opt, and algoritma Dijkstra. Untuk memperbaiki proses pencarian solusi (search process) satu prosedur diversifikasi juga diaplikasikan. Selanjutnya, algoritma yang dikembangkan diuji untuk menyelesaikan data-data yang terdapat pada literatur.Kata kunci: multi-level, heuristik, ruting, heterogeneous fleet 
Model Keseimbangan Lintas Perakitan Menggunakan Algoritma Variable Neighborhood Descent dengan Kriteria Minimasi Stasiun Kerja Imran, Arif; Luis, Martino; Rahadian, Danang; Zaini, Emsosfi
JURNAL ITENAS REKAYASA Vol 16, No 1 (2012)
Publisher : Jurnal ITENAS Rekayasa

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

Abstract

ABSTRAKPenelitian ini membahas masalah keseimbangan lintasan perakitan sederhana tipe I (Single Assembly Line Balancing Problem I (SALBP I)) menggunakan algoritma Variable Neigborhood Descent (VND) dengan kriteria minimisasi jumlah stasiun kerja. Algoritma VND terdiri dari dua tahap, yaitu tahap pembangkitan solusi inisial dan tahap local search. Solusi awal diperoleh dengan mengaplikasikan algoritma region approach yang kemudian diperbaiki dengan menggunakan neighborhood/local-search seperti 1-0 insertion dan swap (1-1 interchange). Algoritma usulan diuji dengan menggunakan beberapa data set yang terdapat dalam literatur. Hasil pengujian menunjukkan bahwa algoritma usulan dapat menghasilkan solusi yang sama dengan solusi terbaik yang telah dipulikasikan.Kata kunci: assembly line balancing, local search, variable neighborhood, stasiun kerja. ABSTRACTThis paper address the Single Assembly Line Balancing Problem I (SALBP I) using the Variable Neigborhood Descent (VND) with minimizing work station number criterion. The VND algorithm consist of two steps, the generation of the initial solution and the improvement step that using several neighborhoods/local searches. The initial solution is obtained by applying the region approach algorithm and then improved by using two neighborhoods/local searches, the 1-0 insertion and the 1-1 inter-change (swap). The proposed algorithm is tested using data sets from literatures. The result shows that the proposed algorithm produces similar results with the best known solution published.Keywords: assembly line balancing, local search, variable neighborhood, work station.
Co-Authors Adhie Nurdiansyah Pamungkas Alex Saleh Alfian Suyudi, Alfian Ali Mukhsinin Ardhi Rahman Fauzi Bagus Dwicahyo Dewantoro 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 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