Papers › A rolling horizon heuristic approach for a multi-stage stochastic waste collection problem

A rolling horizon heuristic approach for a multi-stage stochastic waste collection problem

23 May 2024arXiv:2405.14499links table onlyarchive 2025-07-28

Andrea Spinelli, Francesca Maggioni, Tânia Rodrigues Pereira Ramos, Ana Paula Barbosa-Póvoa, Daniele Vigo

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.

In this paper we present a multi-stage stochastic optimization model to solve an inventory routing problem for recyclable waste collection. The objective is the maximization of the total expected profit of the waste collection company. The decisions are related to the selection of the bins to be visited and the corresponding routing plan in a predefined time horizon. Stochasticity in waste accumulation is modeled through scenario trees generated via conditional density estimation and dynamic stochastic approximation techniques. The proposed formulation is solved through a rolling horizon approach, providing a worst-case analysis on its performance. Extensive computational experiments are carried out on small- and large-sized instances based on real data provided by a large Portuguese waste collection company. The impact of stochasticity on waste generation is examined through stochastic measures, and the performance of the rolling horizon approach is evaluated. Some managerial insights on different configurations of the instances are finally discussed.

PaperPDFCode

Code

aspinellibg/StochwasteIRP officialmentioned in papermentioned on GitHub report

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