Fitri Maya Puspita
Mathematics Department, Faculty of Mathematics and Natural Sciences, Sriwijaya University, Indralaya, 30662, Indonesia

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

Found 2 Documents
Search

Greedy Reduction Algorithm as the Heuristic Approach in Determining the Temporary Waste Disposal Sites in Sukarami Sub-District, Palembang, Indonesia Sisca Octarina; Fitri Maya Puspita; Siti Suzlin Supadi; Nur Attina Eliza
Science and Technology Indonesia Vol. 7 No. 4 (2022): October
Publisher : Research Center of Inorganic Materials and Coordination Complexes, FMIPA Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1079.812 KB) | DOI: 10.26554/sti.2022.7.4.469-480

Abstract

Waste is one of the problems in Palembang, Indonesia. The amount of waste in Palembang increases proportionally to the population yearly and can adversely affect the community. Therefore, we determine the optimal temporary waste disposal site (TWDS) to optimize the problems. The set covering model is the proper model for solving the location and allocation problem. In this study, data on the distance between each TWDS is needed in the set covering modeling. The novelty in this research is developing the p-median problem model, which is formed from the optimal solution of the set covering location problem (SCLP) model. Palembang consists of 18 sub-districts, of which the Sukarami sub-district has the highest population density. This study discussed the determination of strategic TWDS in the Sukarami sub-district using the SCLP model, the p-median problem, and a heuristic approach, namely the greedy reduction algorithm in solving the model. Based on the solution of the p-median problem model with LINGO 18.0 and the p-median problem solved by the greedy reduction algorithm, only three strategic TWDS were found for the Sukarami sub-district. The study results recommend a review of the existing TWDS and particularly the addition of a TWDS in Sukodadi and Talang Betutu villages, respectively.
Formulation of Set Covering Problem Using Myopic Algorithm and Greedy Reduction Algorithm in Determining the Location of Temporary Landfills in Semambu Island Village, Ogan Ilir Regency, South Sumatra Fitri Maya Puspita; Sisca Octarina; Laila Hanum; Chatrin Yohana Simamora; Helena Valenta Br Kemit; Evi Yuliza
Science and Technology Indonesia Vol. 8 No. 2 (2023): April
Publisher : Research Center of Inorganic Materials and Coordination Complexes, FMIPA Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26554/sti.2023.8.2.184-194

Abstract

This study discusses Set Covering Problem (SCP) in designing the optimal temporary waste disposal site (TWDS) in Semambu Island Village using the Myopic Algorithm (MA) and Greedy Reduction Algorithm (GRA). The analysis was carried out and compared using a maximum distance of 500m and 1000m to get the best solution from two methods. The results of the p Median Problem by LINGO 13.0 software and MA with a maximum distance of 500m show the same TWDS location, namely Working Area (WA) 1, 2, 3, 4, 5, and 6 with the location of the candidate TWDS being at TWDS 2 WA 1, TWDS 1 WA 2, TWDS 2 WA 3, and TWDS 2 WA 5. For 1000m, it will be the location of the candidate’s TWDS being at TWDS 2 WA 1, TWDS WA 2, and TWDS 2 WA 3. Using GRA, results were obtained will be 4 TWDS, namely TWDS 2 Hamlet 1, TWDS 1 Hamlet 2, TWDS 2 Hamlet 3, TWDS 2, Hamlet 5. Then using GRA, 2 solutions are obtained, namely columns 2 and 5 which dominate. Column 2 nomination are Hamlets 1, 2, 3, and 6. Column 5 which dominates will be Hamlets 1, 3, 5, and 6.