Adji Chandra Kurniawan
Pertamina University

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

Found 2 Documents
Search

Simulated annealing algorithm for solving the capacitated vehicle routing problem: a case study of pharmaceutical distribution Anak Agung Ngurah Perwira Redi; Fiki Rohmatul Maula; Fairuz Kumari; Natasha Utami Syaveyenda; Nanda Ruswandi; Annisa Uswatun Khasanah; Adji Chandra Kurniawan
Jurnal Sistem dan Manajemen Industri Vol. 4 No. 1 (2020)
Publisher : Universitas Serang Raya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (630.592 KB) | DOI: 10.30656/jsmi.v4i1.2215

Abstract

This study aims to find a set of vehicles routes with the minimum total transportation time for pharmaceutical distribution at PT. XYZ in West Jakarta. The problem is modeled as the capacitated vehicle routing problem (CVRP). The CVRP is known as an NP-Hard problem. Therefore, a simulated annealing (SA) heuristic is proposed. First, the proposed SA performance is compared with the performance of the algorithm form previous studies to solve CVRP. It is shown that the proposed SA is useful in solving CVRP benchmark instances. Then, the SA algorithm is compared to a commonly used heuristic known as the nearest neighborhood heuristics for the case study dataset. The results show that the simulated Annealing and the nearest neighbor algorithm is performing well based on the percentage differences between each algorithm with the optimal solution are 0.03% and 5.50%, respectively. Thus, the simulated annealing algorithm provides a better result compared to the nearest neighbour algorithm. Furthermore, the proposed simulated annealing algorithm can find the solution as same as the exact method quite consistently. This study has shown that the simulated annealing algorithm provides an excellent solution quality for the problem.
Pemilihan Lokasi Operasi Timbang untuk fasilitas Community & Playground Center Menggunakan Model Maximum Covering Location Problem di Kota Iloilo, Filipina Anak Agung Ngurah Perwira Redi; Roland Ross Faina Flame; Anak Agung Ngurah Agung Redioka; Winarno Winarno; Adji Chandra Kurniawan
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 | Full PDF (733.653 KB) | 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.