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 (...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Academic Research Publishing Group
2018
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/26047/1/IJSSR%206%202018%20695%20700.pdf |
| _version_ | 1803629051435286528 |
|---|---|
| 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 |
| collection | UUM |
| 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. |
| first_indexed | 2024-07-04T06:31:42Z |
| format | Article |
| id | uum-26047 |
| institution | Universiti Utara Malaysia |
| language | English |
| last_indexed | 2024-07-04T06:31:42Z |
| publishDate | 2018 |
| publisher | Academic Research Publishing Group |
| record_format | dspace |
| spelling | uum-260472019-05-15T00:32:44Z https://repo.uum.edu.my/id/eprint/26047/ 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 cc4_by https://repo.uum.edu.my/id/eprint/26047/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 (SPI6). pp. 695-700. ISSN 24136670 http://doi.org/10.32861/jssr.spi6.695.700 doi:10.32861/jssr.spi6.695.700 doi:10.32861/jssr.spi6.695.700 |
| 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 |
| title | 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_short | 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 |
| topic | QA75 Electronic computers. Computer science |
| url | https://repo.uum.edu.my/id/eprint/26047/1/IJSSR%206%202018%20695%20700.pdf |
| work_keys_str_mv | AT matnurazriati efficiencyofheuristicalgorithmsinsolvingwastecollectionvehicleroutingproblemacasestudy AT benjaminaidamauziah efficiencyofheuristicalgorithmsinsolvingwastecollectionvehicleroutingproblemacasestudy AT abdulrahmansyariza efficiencyofheuristicalgorithmsinsolvingwastecollectionvehicleroutingproblemacasestudy |