Article Per Year (5 Year)
p-Index From 2020 - 2025
0.408
P-Index
This Author published in this journals
All Journal Industrika : Jurnal Ilmiah Teknik Industri Electronic Journal of Education, Social Economics and Technology
Ramdan, Deni Muhamad
Unknown Affiliation
Religion Arts Humanities Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Electrical & Electronics Engineering Engineering Environmental Science Health Professions Industrial & Manufacturing Engineering Languange, Linguistic, Communication & Media Law, Crime, Criminology & Criminal Justice Library & Information Science Mathematics Nursing Public Health Social Sciences Veterinary Other

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

Found 2 Documents
Search

 1 
Perancangaan Rute Pengiriman Optimal dengan Vehicle Routing Problem (VRP) untuk Efisiensi Distribusi di Jaya Abadi Fruits Ramdan, Deni Muhamad; R, Annisa Nurhikmah; Arifahyani, Elviana; Fauzi, Muchammad
Industrika : Jurnal Ilmiah Teknik Industri Vol. 9 No. 3 (2025): Industrika: Jurnal Ilmiah Teknik Industri
Publisher : Fakultas Teknik Universitas Tulang Bawang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.37090/indstrk.v9i3.2221

Abstract

This study focuses on optimizing the distribution routes at Jaya Abadi Fruits using the Vehicle Routing Problem (VRP) method with a Saving Matrix approach. The primary issue is the manual route management that relies solely on the drivers' memory, leading to frequent wastage of travel distance, time, and operational costs. Moreover, the stochastic nature of customer demand complicates daily supply planning and results in suboptimal fulfillment of customer needs. This research utilizes primary data collected through direct observation and interviews to gain an accurate understanding of the distribution process. The Saving Matrix analysis is applied to identify optimal routes, reducing the travel distance from 109.4 km to 61.8 km (a savings of 43.51%), cutting travel time from 4.46 hours to 2.20 hours (a savings of 50.67%), and lowering distribution costs from IDR 279,400 to IDR 231,800 (a savings of 17.04%). Keywords: Distribution, Efficiency, Saving Matrix, Vehicle Routing Problem
Route Optimization for Perishable Goods Distribution Using Ant Colony Optimization: A Capacitated Vehicle Routing Problem (CVRP) Case Study Ramdan, Deni Muhamad; Hartati, Verani
Electronic Journal of Education, Social Economics and Technology Vol 6, No 1 (2025)
Publisher : SAINTIS Publishing

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33122/ejeset.v6i1.729

Abstract

This study addresses inefficiencies in route planning for the distribution of perishable goods by a small-scale enterprise, Jaya Abadi Fruits, located in East Jakarta. The current manual delivery planning, reliant on driver experience, results in suboptimal distances, increased fuel usage, and inconsistent service quality. To overcome these challenges, the Ant Colony Optimization (ACO) algorithm was applied to a Capacitated Vehicle Routing Problem (CVRP) and implemented using MATLAB. The model incorporates real-world parameters such as delivery distances, box dimensions, demand volume, and vehicle capacities. Simulation results demonstrate significant improvements: for Vehicle 1, travel distance and distribution cost were reduced by 41.93% and 15.6%, respectively; for Vehicle 2, distance decreased by 30.96% and cost by 2.03%. These findings validate ACO as an effective, low-cost, and scalable decision-support tool for logistics operations in small enterprises lacking integrated digital infrastructure. The research contributes to the optimization of last-mile delivery in resource-limited supply chains, particularly in emerging economies.
Co-Authors Arifahyani, Elviana Muchammad Fauzi R, Annisa Nurhikmah Verani Hartati