Papers › An integrated selection and routing policy for urban waste collection
An integrated selection and routing policy for urban waste collection
Niels A. Wouda, Marjolein Aerts-Veenstra, Nicky van Foreest
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We study a daily urban waste collection problem arising in the municipality of Groningen, The Netherlands, where residents bring their waste to local underground waste containers organised in clusters. The municipality plans routes for waste collection vehicles to empty the container clusters. These routes should be as short as possible to limit operational costs, but also long enough to visit sufficiently many clusters and ensure that containers do not overflow. A complicating factor is that the actual fill levels of the clusters' containers are not known, and only the number of deposits is observed. Additionally, it is unclear whether the containers should be upgraded with expensive fill level sensors so that the service level can be improved or routing costs can be reduced. We propose an efficient integrated selection and routing (ISR) policy that jointly optimises the daily cluster selection and routing decisions. The integration is achieved by first estimating prizes that express the urgency of selecting a cluster to empty, and then solving a prize-collecting vehicle routing problem with time windows and driver breaks to collect these prizes while minimising routing costs. We use a metaheuristic to solve the prize-collecting vehicle routing problem inside a realistic simulation environment that models the waste collection problem faced by the municipality. We show that solving the daily waste collection problem in this way is very effective, and can lead to substantial cost savings for the municipality in practice, with no reduction in service level. In particular, by integrating the container selection and routing problems using our ISR policy, routing costs can be reduced by more than 40% and the fleet size by 25%. We also show that more advanced measuring techniques do not significantly reduce routing costs, and the service level not at all.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections