Text
ALGORITMA GREEDY HEURISTIC DALAM PENYELESAIAN SET COVERING PROBLEM PADA PENENTUAN LOKASI DISTRIBUSI VAKSIN COVID 19 DI KOTA PALEMBANG
Optimizing the location of service facilities is very important so that people can reach and use these facilities. This study discusses the settlement of the Set Covering Problem (SCP) in determining the distribution location of the Covid-19 vaccine in Palembang City using the Greedy Heuristic algorithm. The distance of the Covid-19 vaccine distribution location in each sub-district was used for the formulation data of the Set Covering Location Problem (SCLP) model. Then, we formulate the p-Center Location Problem model and implement the Greedy Heuristic algorithm to determine the optimal distribution location for the Covid-19 vaccine. The SCLP model produces 27 optimal Covid-19 vaccine locations in Palembang City. Meanwhile, the completion of the p-Center Location Problem model also resulted in 27 optimal vaccine locations which were located at Ariodillah Health Center, Naga Swidak, Sako, Bukitsangkal, Sei Lincah, Kenten, Kalidoni, Pakjo, Sei Baung, Merdeka, OPI, Social, Talang Betutu, RS Myria, Sukarami, Keramasan, Karya Jaya, 7 Ulu, Sabokingking, Charitas Hospital, RSUD Dr. Mohammad Hasan, Siti Khadijah Hospital, Bunda Hospital, Bunda Noni Hospital, Palembang Class II Port Health Office, Tiara Fatin Hospital, and Alang-Alang Lebar Health Center.
Inventory Code | Barcode | Call Number | Location | Status |
---|---|---|---|---|
2207003488 | T77546 | T775462022 | Central Library (Referens) | Available but not for loan - Not for Loan |
No other version available