Claim Missing Document
Check
Articles

Found 13 Documents
Search

Usulan Rute Pendistribusian Gas LPG Menggunakan Algoritma Dijkstra dan Algoritma Genetika Pada  Model CGVRP Oktaviani, Putri; Dalnis, Intan Permata; Wirdianto, Eri
Jurnal Rekayasa Sistem Industri Vol. 14 No. 1 (2025): Jurnal Rekayasa Sistem Industri
Publisher : Universitas Katolik Parahyangan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26593/jrsi.v14i1.8491.131-145

Abstract

Determining the route of distribution of goods for companies is an important aspect to consider. The distribution of 3 kg LPG gas at one of the companies in Bandung City does not yet have an optimal route. However, in previous research, a shorter route has been obtained with the Sweep algorithm, which is 118.85 km. The research continued using the Cluster Generalized Vehicle Routing Problem (CGVRP) model with the Dijkstra and Genetics algorithms. CGVRP is the determination of the shortest route using customer clusters. Dijkstra's algorithm is the determination of the route between 2 points from the starting point to the destination point. The result of the distance calculation with the Djkstraa algoritma is 114.779 km. Genetic Algorithm is the determination of the shortest route by reducing the attributes that are less dominant. The result of the distance calculating with Genetic Algorithm is 112 km. This shows a reduction in the total distribution mileage of 6.85 km compared to the completion of the Sweep algorithm in previous studies. The amount of this reduction is large enough to save the company's costs by 5.76%.
Penerapan Siklus Plan-Do-Check-Act (PDCA) untuk Mengurangi Pemborosan dalam Industri Jasa Rahmayanti, Dina; Wirdianto, Eri; Afrileni, Wirna
Jurnal Optimalisasi Vol 11, No 2 (2025): Oktober
Publisher : Universitas Teuku Umar

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35308/jopt.v11i2.12337

Abstract

This research aims to increase the efficiency of aging time in the car refurbished process in T XYZ by applying the PDCA (Plan-Do-Check-Action) method. The company's main problem is the high number of idle cars due to aging times that exceed standards, especially in repair, service, and preparation activities. The research methods used include identifying the root of the problem using a fishbone diagram, designing solutions using the 5W+1H approach, improving implementation, and evaluating results. Implementation results show a decrease in the average aging time: in repair from 5,333 to 3,833 days, in service from 6 to 3,333 days, and preparation from 1,333 to 0.967 days. The number of idle cars also decreased gradually to reach 86 units with an actual aging time of one day. These findings prove that implementing PDCA effectively increases the efficiency of the refurbished process, reduces time waste, and supports increased company operational performance. This research contributes to developing continuous improvement practices in the automotive industry. It can be a reference for other service companies that are optimizing productivity through a quality management approach.
Solving Heterogenous Fleet Capacitated Vehicle Routing Problem with Time Windows Using Cooperative Hybrid Firefly Algorithm Ananda, Defri; Wirdianto, Eri; Alfandi, Rahmad
Andalasian International Journal of Applied Science, Engineering and Technology Vol. 5 No. 3 (2025): November 2025
Publisher : LPPM Universitas Andalas

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/aijaset.v5i3.154

Abstract

The Vehicle Routing Problem with Time Windows (VRPTW) is a widely studied logistics optimization problem, and its complexity increases when heterogeneous fleets are considered. This study proposes the application of the Cooperative Hybrid Firefly Algorithm (CHFA), an extension of the Firefly Algorithm, to solve the Heterogeneous Vehicle Routing Problem with Soft Time Windows (HVRPSTW). The mathematical model was implemented in Python, tested on benchmark datasets, and adapted to a fleet consisting of three vehicle types with different capacities to serve 100 customers. The proposed CHFA achieved feasible routing solutions with a total transportation cost of IDR 17.58 million and a computation time of only 30 seconds. These results demonstrate that CHFA can provide fast and efficient solutions for complex routing problems, making it highly applicable in logistics operations that demand quick decision-making and cost efficiency.