Skripsi
FORMULASI MODEL SET COVERING PROBLEM DAN IMPLEMENTASI ALGORITMA GREEDY HEURISTIC DALAM PENENTUAN LOKASI TEMPAT PEMBUANGAN SEMENTARA (TPS) SAMPAH DI KECAMATAN SAKO DAN KECAMATAN ILIR TIMUR I
Optimizing the facility location has a vital role in providing services to the community as a whole. This research discussed about optiming the location of Temporary Disposal Site in Sako district and Ilir Timur I district Palembang. Data on the distance of the TPS in each district is used for the formulation of the SCLP model which is completed with Lingo 18.0. Then the p-Median Problem model formulation and implementation of Greedy Heuristic Algorithm in determining the optimal TPS are carried out. Sako district consists of four villages and nine Temporary Disposal Sites, and Ilir Timur I district consists of eleven villages and twenty-two Temporary Disposal Sites. Based on the formulation of the Set Covering Problem model and implementation of the Greedy Heuristic Algorithm, there are six optimal Temporary Disposal Sites in Sako district and fifteen optimal Temporary Disposal Sites in Ilir Timur I district. From solution of the Set Covering Problem model and implementation of the Greedy Heuristic Algorithm the suggested solution is the solution obtained by Greedy Heuristic Algorithm because the solution from the algorithm can meet all requests in the Sako district and in the Ilir Timur I district. But there are some unoptimal location, so it is necessary to recommend the new location of Temporary Disposal Site in Sako district and Ilir Timur I district. Keywords:Location Optimization, Temporary Disposal Site, Set Covering Problem Model, Greedy Heuristic Algorithm.
Inventory Code | Barcode | Call Number | Location | Status |
---|---|---|---|---|
2107003443 | T51300 | T513002021 | Central Library (REFERENCES) | Available but not for loan - Not for Loan |
No other version available