Finding the Shortest Route of Waste Collection by Metaheuristic Algorithms using SCILAB

摘要

This research focuses on finding the route of waste collection to optimise the route of waste collection for the smallest value cost in waste management. The objective function to find the minimal total cost for finding the shortest route of waste collection with respect to garbage truck capacity by using metaheuristic techniques are considered as the best choice. This research uses two techniques of metaheuristic methods; cuckoo search algorithm (CS), and firefly algorithm (FA) to compare the performances. A case study of the real problem with the obtained results is also discussed in the paper. The result shows that the FA algorithm can obtain the global optimal solution, has a faster convergence, and can minimize total objective function for finding the shortest route of waste collection. The result of the research also shows a sequence in which the garbage truck should use to collect the waste from all of the bins to the landfill facility.