Skripsi
MODEL SET COVERING PROBLEM DAN ALGORITMA GREEDY HEURISTIC PADA PENENTUAN TITIK PEMBERHENTIAN FEEDER LRT MUSI EMAS RUTE STASIUN LRT POLRESTA-PERUMAHAN OPI
This study aims to optimize the location of the stop point of the Feeder LRT Musi Emas on the LRT Polresta-Residential OPI Station Route using the Covering Based Problem (CBP) model formulation, namely the Set Sovering Location Problem (SCLP) and Maximal Covering Location Problem (MCLP) and the Greedy Heuristic algorithm with the LINGO 13.0 software tool. The Greedy Heuristic algorithm can solve optimization problems such as determining the location of the optimal location point. The LRT Polresta-Residential OPI Station route is a route that has 30 stopping points. The CBP model produces the optimal stopping point location according to the demand point. While the Greedy Heuristic algorithm produces 15 additional new stop point LRT that can maximize the stop demand point on the Feeder LRT Musi Emas LRT Polresta-Residential OPI Station Route. Therefore, this research recommends the Greedy Heuristic algorithm solution, because the Greedy Heuristic algorithm solution can fulfill the demand on the Feeder LRT Musi Emas Corridor IV LRT Polresta-Residential OPI Station Route. Keyword : Covering Based Problem, Set Covering Location Problem, Maximal Covering Location Problem, Greedy Heuristic Algorithm, Feeder LRT Musi Emas
Inventory Code | Barcode | Call Number | Location | Status |
---|---|---|---|---|
2507005857 | T184280 | T1842802025 | Central Library (Reference) | Available but not for loan - Not for Loan |