Finding An Alternative Routing For Solid Waste Management

Manoharam, Gaeithry (2020) Finding An Alternative Routing For Solid Waste Management. Masters thesis, UNSPECIFIED.

Download (424kB) | Preview


Finding the shortest route for transferring solid waste is one of the biggest challenges for every solid waste management organization. Globally, waste collection process represents 74% of operating costs, yet it has been given minor attention. In this research, Dijkstra Algorithm and Travelling Salesman Problem (TSP) using GIS Software 10.1 were used to optimize the route from Seberang Perai Industrial area to Ampang Jajar waste transfer station. Using the technique, we compare the existing and optimized route with the 24 companies from phases I, II and IV in the Seberang Perai Industrial area to waste transfer stations. Dijkstra and TSP are some of the classic algorithms in the GIS which are used to find the shortest route to reduce the operating cost. Carbon emission is an extended part of this study by comparing transportation fuel consumption between existing routes and optimized routes.

Item Type: Thesis (Masters)
Subjects: Q Science > QA Mathematics > QA1 Mathematics (General)
Divisions: Pusat Pengajian Sains Matematik (School of Mathematical Sciences) > Thesis
Depositing User: Mr Hasmizar Mansor
Date Deposited: 23 May 2022 07:01
Last Modified: 23 May 2022 07:05

Actions (login required)

View Item View Item