Finding An Alternative Routing For Solid Waste Management

Finding An Alternative Routing For Solid Waste Management

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 Sal...

Full description

Saved in:
Bibliographic Details
Main Author: Manoharam, Gaeithry
Format: Thesis
Language:English
Published: 2020
Subjects:
QA1 Mathematics (General)
Online Access:http://eprints.usm.my/52557/1/Pages%20from%20Full%20thesis%20after.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
id my-usm-ep.52557
record_format uketd_dc
spelling my-usm-ep.525572022-05-23T07:05:23Z Finding An Alternative Routing For Solid Waste Management 2020-11 Manoharam, Gaeithry QA1 Mathematics (General) 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. Pusat Pengajian Sains Matematik 2020-11 Thesis http://eprints.usm.my/52557/ http://eprints.usm.my/52557/1/Pages%20from%20Full%20thesis%20after.pdf application/pdf en public masters
institution Universiti Sains Malaysia
collection USM Institutional Repository
language English
topic QA1 Mathematics (General)
spellingShingle QA1 Mathematics (General)
Manoharam, Gaeithry
Finding An Alternative Routing For Solid Waste Management
description 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.
format Thesis
qualification_level Master's degree
author Manoharam, Gaeithry
author_facet Manoharam, Gaeithry
author_sort Manoharam, Gaeithry
title Finding An Alternative Routing For Solid Waste Management
title_short Finding An Alternative Routing For Solid Waste Management
title_full Finding An Alternative Routing For Solid Waste Management
title_fullStr Finding An Alternative Routing For Solid Waste Management
title_full_unstemmed Finding An Alternative Routing For Solid Waste Management
title_sort finding an alternative routing for solid waste management
publishDate 2020
url http://eprints.usm.my/52557/1/Pages%20from%20Full%20thesis%20after.pdf
_version_ 1747822190526464000

Similar Items