UUM Repository | Universiti Utara Malaysian Institutional Repository
FAQs | Feedback | Search Tips | Sitemap

Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study

Mat, Nur Azriati and Benjamin, Aida Mauziah and Abdul-Rahman, Syariza (2018) Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study. The Journal of Social Sciences Research, 6 (SPI6). pp. 695-700. ISSN 24136670

[img] PDF
Restricted to Registered users only

Download (462kB) | Request a copy


This paper investigated the efficiency of six heuristic algorithms from prior studies in the attempt to solve issues related to waste collection, namely: (i) Nearest Greedy (NG), (ii) Further from Depot (FFD), (iii) Different Initial Customer (DIC), (iv) Savings Approach, (v) Sweep Algorithm, and (vi) Different Initial Customer based on Sweep Algorithm. In fact, these heuristics have been employed to solve several routing problems in past studies, but the performance of each heuristic has never been compared. Hence, this paper looked into the efficiency of these heuristics by testing them on a real case study of waste collection problem in a district located at the north of Peninsular Malaysia. Several solutions obtained from these heuristics were compared with solutions implemented by the waste collection company, especially in terms of the total distance travelled. As a result, the computational results exhibited that DIC generated the best solutions, when compared to other heuristics, with a 12% reduction of the total travel distance.

Item Type: Article
Uncontrolled Keywords: Case study; Heuristics; Vehicle routing problem; Waste collection problem.
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:40
Last Modified: 15 May 2019 00:40
URI: http://repo.uum.edu.my/id/eprint/26053

Actions (login required)

View Item View Item