OPTIMALISASI PENDISTRIBUSIAN GAS LPG PT. SEULAWAH INONG MALANG DENGAN ALGORITMA ACS-RVND PADA HFVRPTW
DOI:
https://doi.org/10.26740/mathunesa.v14n1.p575-584Abstract
Seulawah Inong faces challenges in managing the distribution process so that LPG gas deliveries can be made on time with minimal operational costs. The main challenge lies in determining an efficient distribution route, given the limited vehicle capacity, differences in costs and heterogeneous fleet capacity, and delivery time constraints, in accordance with the characteristics of the Heterogeneous Fleet Vehicle Routing Problem with Time Windows (HFVRPTW). This study aims to optimally solve this problem by utilizing the Ant Colony System with Randomized Variable Neighborhood Descent (ACS-RVND) algorithm application on the Heterogeneous Fleet Vehicle Routing Problem with Time Windows (HFVRPTW). The results show that with the use of 10 ants, the algorithm successfully generated five optimal distribution routes, with a total distance of 66.11 km, a total service time of 1,242.72 minutes, and a total operational cost of Rp 76,026.5
Keywords: Gas distribution, Route optimization, HFVRPTW, ACS-RVND Algorithm.
Downloads
Downloads
Published
Issue
Section
License
Copyright (c) 2026 MATHunesa: Jurnal Ilmiah Matematika

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Abstract views: 3
,
PDF Downloads: 4









