A Biased-Randomized Heuristic for the Waste Collection Problem in Smart Cities
Journal
Advances in Intelligent Systems and Computing
ISSN
2194-5357
Date Issued
2018
Author(s)
Abstract
This paper describes an efficient heuristic to solve the Waste Collection Problem (WCP), which is formulated as a special instance of the well-known Vehicle Routing Problem (VRP). Our approach makes use of a biased-randomized version of a savings-based heuristic. The proposed procedure is tested against a set of benchmark instances, obtaining competitive results. © Springer International Publishing AG, part of Springer Nature 2018.