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

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

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 th...

Full description

Bibliographic Details
Main Authors: Fitri Maya Puspita, Sisca Octarina, Laila Hanum, Chatrin Yohana Simamora, Helena Valenta Br Kemit, Evi Yuliza
Format: Article
Language:English
Published: Magister Program of Material Sciences, Graduate School of Universitas Sriwijaya 2023-04-01
Series:Science and Technology Indonesia
Subjects:
set covering problem
greedy reduction algorithm
myopic algorithm
semambu island village
optimal tps location
Online Access:https://sciencetechindonesia.com/index.php/jsti/article/view/659/304

Internet

https://sciencetechindonesia.com/index.php/jsti/article/view/659/304

Similar Items