Redioka, Anak Agung Ngurah Agung
Unknown Affiliation

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

Found 2 Documents
Search

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.
Pemilihan Lokasi Operasi Timbang untuk fasilitas Community & Playground Center Menggunakan Model Maximum Covering Location Problem di Kota Iloilo, Filipina Redi, Anak Agung Ngurah Perwira; Flame, Roland Ross Faina; Redioka, Anak Agung Ngurah Agung; Winarno, Winarno; Kurniawan, Adji Chandra
Jurnal Sistem dan Manajemen Industri Vol. 6 No. 2 (2022): December
Publisher : Universitas Serang Raya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30656/jsmi.v6i2.4599

Abstract

Operation Timbang (OPT) Plus is one of the Philippines’ programs that focuses on nutrition by conducting an annual assessment for 0-59 months old children in barangays to identify the malnutrition data in the area. The barangay is the smallest administrative entity in the Philippines. OPT is a plan of action that estimates the number of malnutrition individuals and identifies those who will get prioritized programs in the community. The Iloilo City Health Office conducted the program in seven districts in the Philippines. The office planned to establish a community centre and playground facility based on the priority/demand areas. Maximum Covering Location Problem (MCLP) is used for this study to determine the optimal location that covers the area. A Mathematical Programming Language (AMPL) is used to apply mathematical programming to the MCLP. The results can be used to identify the optimal facility and the maximum coverage of the demand points. The experiment showed that the facility located in Mandurriao District is the optimal facility location. For Underweight/Severely Underweight children, a maximum total of 646 are covered, and for the Overweight/Obese, 1,041 are covered for the chosen facility. In addition, the findings of the sensitivity analysis indicate that the building of the three facilities in the case study can offer 100 percent of the required coverage area.