Abdurrahman, Ahmad Fauzan
School of Industrial Engineering, Telkom University

Published : 2 Documents
Articles

Found 2 Documents
Search

Completion Vehicle Routing Problem (VRP) In Determining Route And Determining The Number Of Vehicles In Minimizing Transportation Costs In PT. XYZ With Using Genetic Algorithm Abdurrahman, Ahmad Fauzan
International Journal of Innovation in Enterprise System Vol 2 No 01 (2018): International Journal of Innovation in Enterprise System
Publisher : School of Industrial Engineering, Telkom University

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

Abstract

In the transportation process is closely related to the route, the route is the path through which a mode / vehicle to arrive at a destination. The route is related to the number of vehicles and the location where it goes. PT XYZ is a company engaged in fast moving consumer goods (FMCG), with the field makes the flow of goods speed will be high until the goods distribution process becomes fast and often. In the process of distribution is done by using 1 fleet in each customer. Currently in the process of distributing goods, the company still ignores the utility of the vehicles used, so the availability of empty space in capacity is still occurring and this makes the cost of transportation is high. Consolidation of multiple customers becomes possible, keeping in mind the time window, capacity and multiple products. This study designs a route by considering the limits to get the route, the number of vehicles, the utility increase of each vehicle and the optimal distance so that it can minimize transportation costs. The use of a genetic algorithm preceded by the nearest neighbor algorithm is used to solve this problem. Later the route will be formed and get the number of vehicles, the increase in vehicle utility and the optimal distance. This resulted in average vehicle utility improvement of 35,317%, vehicle repairs amounted to 34.05%, and distance of 10.075% so as to reduce transportation costs by 26.56% from initial conditions.
Penyelesain Vehicle Routing Problem (VRP) dalam Penugasan Kendaraan dan Penentuan Rute untuk Meminimasi Biaya Transportasi pada PT. XYZ dengan Menggunakan Algoritma Genetika Abdurrahman, Ahmad Fauzan; Ridwan, Ari Yanuar; Santosa, Budi
JURNAL TEKNIK INDUSTRI Vol 9, No 1 (2019): Volume 9 No 1 Maret 2019
Publisher : Jurusan Teknik Industri, Fakultas Teknologi Indusri Universitas Trisakti

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

Abstract

In the process of transportation it is very in accordance with the route, the route the mode / vehicle goes to the destination. Route about the number of vehicles and which locations are passed. PT XYZ is a company engaged in the fast moving consumer goods (FMCG), with fields that make the flow of goods going higher so that the distribution of goods becomes fast and frequent. The distribution process is carried out using 1 fleet in each customer. Currently in the process of distributing goods, companies still use utilities that are used, so that the availability of empty space in capacity still occurs and this makes transportation costs high. Combining (considering) some customers is possible, while considering the time window, capacity and some products. This study discusses the route by considering various constraints to get the route, the number of vehicles, increasing the utility of each vehicle and the optimal distance so as to minimize transportation costs. Using a genetic algorithm that is preceded by the nearest neighbour algorithm is used to resolve this complication. Later the route will be formed and get the number of vehicles, increase the number of vehicles and the optimal distance. These results make an increase in vehicle utility by an average of 35.317%, an increase in the number of vehicles by 34.05%, and a distance of 10.075% thus saving transportation costs by 26.56% from the initial conditions.