Browsing by Author "Sefah, Evans"

Now showing 1 - 1 of 1
  • Thumbnail Image
    Item
    Application of knapsack to site selection problem for solid waste disposal: a case study of Lekzokuku-Krowor Municipal Assembly (LEKMA)
    (2014-11-17) Sefah, Evans
    The knapsack problem is a Classical combinational problem used to model many industrial situations. In this thesis, we modeled landfill sites selection and management challenges in Lekma as binary integer programming problem. The general objective is to determine how the landfill sites in Lekma municipal are selected. Since the problem was modeled as a binary integer programming problem, the branch-and-bound algorithm of the Horowitz-Sahni was used to solve our proposed problem. First, the algorithm was presented along with relevant examples. Data on site, from LEKMA was analyzed from the perspective of the said algorithm. It was observed that the solution that gave optimum achievable value was (1, 1, 0, 0, 0, 1, and 1). This means that the Metropolitan Assembly should spend a total cost of fifty thousand Ghana Cedis (GH¢50,000) to obtain an optimal site development of one hundred and five thousand (GH¢105,000) tones per week, consisting of selecting Site 1, Site 2, Site 6, and Site 7. The use of a well-structured procedure in computation gives a systematic and transparent solution as compared with an arbitrary method. Using the more scientific Knapsack problem model for the landfill site development of LEKMA refuse disposal management gives a better result. We therefore recommend our proposed solution to LEKMA.