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 (...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Academic Research Publishing Group
2018
|
| Subjects: | |
| 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!
|
| Summary: | 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. |
|---|