Cover Image

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

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

Full description

Saved in:
Bibliographic Details
Main Authors: Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza
Format: Article
Language:English
Published: Academic Research Publishing Group 2018
Subjects:
QA75 Electronic computers. Computer science
Online Access:http://repo.uum.edu.my/26053/1/IJSSR%206%202018%20695%20700.pdf
http://repo.uum.edu.my/26053/
http://doi.org/10.32861/jssr.spi6.695.700
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.uum.repo.26053
record_format eprints
spelling my.uum.repo.260532019-05-15T00:40:32Z http://repo.uum.edu.my/26053/ Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study Mat, Nur Azriati Benjamin, Aida Mauziah Abdul-Rahman, Syariza QA75 Electronic computers. Computer science 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. Academic Research Publishing Group 2018 Article PeerReviewed application/pdf en http://repo.uum.edu.my/26053/1/IJSSR%206%202018%20695%20700.pdf 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 http://doi.org/10.32861/jssr.spi6.695.700 doi:10.32861/jssr.spi6.695.700
institution Universiti Utara Malaysia
building UUM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Utara Malaysia
content_source UUM Institutionali Repository
url_provider http://repo.uum.edu.my/
language English
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
Mat, Nur Azriati
Benjamin, Aida Mauziah
Abdul-Rahman, Syariza
Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study
description 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.
format Article
author Mat, Nur Azriati
Benjamin, Aida Mauziah
Abdul-Rahman, Syariza
author_facet Mat, Nur Azriati
Benjamin, Aida Mauziah
Abdul-Rahman, Syariza
author_sort Mat, Nur Azriati
title Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study
title_short Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study
title_full Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study
title_fullStr Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study
title_full_unstemmed Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study
title_sort efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study
publisher Academic Research Publishing Group
publishDate 2018
url http://repo.uum.edu.my/26053/1/IJSSR%206%202018%20695%20700.pdf
http://repo.uum.edu.my/26053/
http://doi.org/10.32861/jssr.spi6.695.700
_version_ 1644284493330120704
score 13.211869

Similar Items