Mat, Nur Azriati and Benjamin, Aida Mauziah and Abdul-Rahman, Syariza and Wibowo, Antoni (2017) Nearest greedy for solving the waste collection vehicle routing problem: A case study. AIP Conference Proceedings, 1905. 040018. ISSN 0094-243X

Full text not available from this repository. (Request a copy)

Abstract

This paper presents a real case study pertaining to an issue related to waste collection in the northern part of Malaysia by using a constructive heuristic algorithm known as the Nearest Greedy (NG) technique. This technique has been widely used to devise initial solutions for issues concerning vehicle routing. Basically, the waste collection cycle involves the following steps: i) each vehicle starts from a depot, ii) visits a number of customers to collect waste, iii) unloads waste at the disposal site, and lastly, iv) returns to the depot. Moreover, the sample data set used in this paper consisted of six areas, where each area involved up to 103 customers. In this paper, the NG technique was employed to construct an initial route for each area. The solution proposed from the technique was compared with the present vehicle routes implemented by a waste collection company within the city. The comparison results portrayed that NG offered better vehicle routes with a 11.07% reduction of the total distance traveled, in comparison to the present vehicle routes.

Item Type:	Article
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:	School of Quantitative Sciences
Depositing User:	Mrs. Norazmilah Yaakub
Date Deposited:	15 May 2019 00:36
Last Modified:	15 May 2019 00:36
URI:	https://repo.uum.edu.my/id/eprint/26050

Actions (login required)

View Item