Efficient Solid Waste Management in Prai Industrial Area through GIS using Dijkstra and Travelling Salesman Problem Algorithms

Abstract

The fourth industrial revolution (IR 4.0) supports new solid waste management and effective routing system for collection and transport of solid wastes, especially in achieving Penang 2030 vision to become a pollution free smart city. This study will enhance Seberang Perai Municipal Council (MBSP) solid waste routing system in Prai industrial area by implementing Dijkstra and Travelling Salesman Problem (TSP) algorithms using Geographic Information System version 10.1. The route optimization study involved 24 companies in Phase I, Phase II, and Phase IV of Prai industrial area. The authority is currently using only one route to transfer the waste-to-waste transfer station. The Dijkstra algorithm can optimize alternative route 1 distance by 19.74% whereby alternative route 2 ended up with extra distance by 3.73% compared to existing single route used by MBSP. The forward Dijkstra algorithm involves single direction route with cleaning depot (source) as starting point and waste transfer station (destination) as ending point. TSP algorithm is having advantage with return direction route. The alternative route 1 evaluated through TSP algorithm gave shorter distance by 6.61% compared to existing route. Alternative route 1 evaluated through Dijkstra algorithm is potential to save fuel cost by 19.75%. Existing route carries 9.2% per year of transportation carbon emission level. The alternative route 1 assessed through Dijkstra and TSP algorithms reported lower carbon emission level at 7.4% per year and 8.6% per year, respectively. Findings of this study can help in improving MBSP’s routing system and realize Penang 2030 vision.