Siti Suzlin Supadi
Institute of Mathematical Sciences, University of Malaya, Kuala Lumpur, 50603, Malaysia

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.
Set Covering Model Using Greedy Heuristic Algorithm to Determine The Temporary Waste Disposal Sites in Palembang Putra Bahtera Jaya Bangun; Sisca Octarina; Rizka Aniza; Laila Hanum; Fitri Maya Puspita; Siti Suzlin Supadi
Science and Technology Indonesia Vol. 7 No. 1 (2022): January
Publisher : Research Center of Inorganic Materials and Coordination Complexes, FMIPA Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (986.328 KB) | DOI: 10.26554/sti.2022.7.1.98-105

Abstract

Optimizing the facility location has a vital role in providing services to the community. This study aims to determine the Temporary Waste Disposal Site (TWDS) in Sako District, Palembang City. The distance data between each TWDS in Sako District is used to formulate the Set Covering model, consisting of the Set Covering Location Problem (SCLP) model and the p-Median Problem model. The classical approach is made by solving both models using Lingo 18.0 software. The Greedy Heuristic algorithm is used as the heuristic approach. Based on the results and discussion, Sako District consists of 4 Villages and 9 TWDS. The SCLP and p-Median Problem models with LINGO 18.0 software and the Greedy Heuristic algorithm show a difference. The study results suggest using the optimal solution resulting from the Greedy Heuristic algorithm because it can meet all requests in Sako District. Research shows that there are six optimal TWDS in Sako District. However, several locations are still not optimal, so it is recommended that there are an additional 14 new TWDS facilities in Sako District to serve all requests.