z-logo
open-access-imgOpen Access
Routes Transportation Problem for Waste Collection System at Sitiawan, Perak, Malaysia
Author(s) -
Shaiful Bakri Ismail,
Dayangku Farahwahida Awang Muhammed
Publication year - 2019
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.b9037.129219
Subject(s) - vehicle routing problem , travelling salesman problem , selection (genetic algorithm) , matlab , computer science , routing (electronic design automation) , sustainability , operations research , data collection , waste collection , transport engineering , mathematical optimization , engineering , mathematics , artificial intelligence , municipal solid waste , waste management , computer network , algorithm , ecology , statistics , biology , operating system
Green logistic concept has emerged and inherently driven by the environmental sustainability challenges. The implementation of Vehicle Routing Problem (VRP) in real world relates with Green Vehicle Routing Problem (GVRP). The research is discussing about solving GVRP for waste collection system in Sitiawan, Perak. The purpose of this research is to design a vehicle routes selection for waste collection system using general optimization method and to examine the result associates with GVRP. Travelling Salesman Problem (TSP) is used as main optimization method and simulated using MATLAB Programming. The expected outcome shown in this paper would be statistical analysis between actual routes and suggested routes to find the best routes. Result shows that routes suggested by TSP had better efficiency about 0.32% which had less distance and 7% (392 minutes) less time than actual routes. However, the actual routes had only had slight differences with the suggested TSP routes. Therefore, the result illustrates that the application of actual route selection by the driver is efficient and the suggested routes by TSP can be applied in real world applications.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here