Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Jurnal Sistem dan Manajemen Industri

ALGORITMA SIMULATED ANNEALING UNTUK OPTIMASI RUTE KENDARAAN DAN PEMINDAHAN LOKASI SEPEDA PADA SISTEM PUBLIC BIKE SHARING Redi, Anak Agung Ngurah Perwira; Redioka, Anak Agung Ngurah Agung
Jurnal Sistem dan Manajemen Industri Vol 3, No 1 (2019)
Publisher : Universitas Serang Raya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (493.419 KB) | DOI: 10.30656/jsmi.v3i1.1473

Abstract

The public bike-sharing system has a problem where the number of bicycles at the docking station needs to be balanced to ensure system user satisfaction. The usual solution is to distribute bicycles so that system users can still park for locations that are usually full of bicycles or pick up bicycles at locations that normally lack bicycles. The purpose of solving this problem is to get a vehicle route with the total operating costs of the vehicle. The full vehicle operating costs are associated with the full time taken by the vehicle to distribute the bicycle. Besides, there are also penalty fees related to the lack of bikes or parking slots at the time of operation of the public bike-sharing facility. In this study, two variations of the simulated annealing (SA) algorithm were developed to solve the SBRP problem called SA_BF and SA_CF. The data used comes from a Velib bike-sharing system case study in Paris, France. The results of the experiment show that both the SA_BF and SA_CF algorithms succeeded in solving SBRP. This algorithm has an average difference of 2.21% and 0.36% of the Arc-Indexed algorithm (AI) from previous studies in the first dataset. As for the second dataset, Tabu Search algorithm, SA_BF and SA_CF obtained an average difference of 0.65%, 1.08% and 0.38% of the optimal results.
Implementasi Algoritma Discrete Particle Swarm Optimization Pada Permasalahan CVRP Aisyahna Nurul Mauliddina; Faris Ahmad Saifuddin; Adesatya Lentera Nagari; Anak Agung Ngurah Perwira Redi; Adji Candra Kurniawan; Nanda Ruswandi
Jurnal Sistem dan Manajemen Industri Vol. 4 No. 2 (2020)
Publisher : Universitas Serang Raya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (880.711 KB) | DOI: 10.30656/jsmi.v4i2.2607

Abstract

Capacitated Vehicle Routing Problem (CVRP) is known as an NP-hard problem. It is because CVRP problems are very hard for finding optimal solutions, especially in large instances. In general, the NP-hard problem is difficult to solve in the exact method, so the metaheuristic approach is implemented in the CVRP problem to find a near-optimal solution in reasonable computational time. This research uses the DPSO algorithm for solving CVRP with ten instances of benchmark datasets. DPSO implementation uses tuning parameters with the One Factor at Time (OFAT) method to select the best DPSO parameters. The outcome objective function will be compared with several PSO models proposed in previous studies. Statistical test using One Way Reputed Measure ANOVA is needed to compare algorithm performance. First, ANOVA uses for comparing’s results. Then, ANOVA is also used to test DPSO’s performance compared with DPSO-SA, SR-1, and SR-2 algorithm. The computational result shows that the basic DPSO algorithm not competitive enough with other methods for solving CVRP.