Text

SET COVERING PROBLEM DENGAN METODE REDUCTION HEURISTIC DALAM MENENTUKAN LOKASI TPS SAMPAH DI DESA PULAU SEMAMBU SUMATERA SELATAN

---

Penilaian

---

This research discusses the Set Covering Problem (SCP) in determining the location of the optimal temporary waste disposal site (TWDS) in Pulau Semambu Village. The data used in this study are hamlet name data, garbage TPS name data, defining variables for each model, and distance measurement data between TWDS. Pulau Semambu Village consists of 6 hamlets with 12 TWDS. Optimization of TWDS in Pulau Semambu Village was carried out using the Location Set Covering Problem (LSCP) and P-Median Problem models with the help of LINGO 13.0 and Reduction Heuristic method. This research uses a minimum distance of 500 meters, 850 meters and 1000 meters. Solutions from all calculations are compared, so that it can be concluded that for a minimum distance of 500 meters it produces 6 TWDS candidates, a minimum distance of 850 meters produces 6 TWDS candidates, and for a minimum distance of 1000 meters it produces 6 TWDS candidates. The results obtained were also compared with the results of previous research using the Greedy Reduction Algorithm (GRA) and Myopic Algorithm methods.

---

Availability

Inventory Code	Barcode	Call Number	Location	Status
2307000330	T89354	T893542023	Central Library (Referens)	Available

Detail Information

Series Title

-

Call Number

T893542023

Publisher

Indralaya : Jurusan Matematika, Fakultas Matematika Dan Ilmu Pengetahuan Alam, Universitas Sriwijaya., 2023

Collation

xviii, 95 hlm.; ilus 29 cm

Language

Indonesia

ISBN/ISSN

-

Classification

510.285 07

Content Type

-

Media Type

-

Carrier Type

-

Edition

-

Subject(s)

Jurusan Matematika
Pengolahan dan Analisa Data di Bidang Matematika

Specific Detail Info

-

Statement of Responsibility

PITRIA

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment