Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2409.13386

An integrated selection and routing policy for urban waste collection

Niels A. Wouda·Marjolein Aerts-Veenstra·Nicky van Foreest
View original source ↗Read source document ↗Export metadata ↓

Abstract

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.

Explore related subjects

math.OCstat.AP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Niels A. Wouda, Marjolein Aerts-Veenstra, Nicky van Foreest. 2024-09-20. An integrated selection and routing policy for urban waste collection. https://arxiv.org/abs/2409.13386

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On the stability of proximal operators in Wasserstein spaces under different notions of convexity

The proximal operator is a fundamental tool in variational analysis and optimization. In the setting of a Hilbert space, given a proper, lower semicontinuous convex functional, its proximal operator is non-expansive, that is, 1-Lipschitz continuous. In the Wasserstein setting, the contraction properties of this operator have been investigated from different perspectives by Carlen and Craig and by Adve and Mészáros, among others, and are not completely understood. In this paper, we study the stability properties of proximal maps, with a particular focus on non-expansivity, under various notions of convexity of the functional that can be considered in the Wasserstein space.

math.OC↗
arXiv2026

Symmetry-dependence in Rounding of a Convex Body

The symmetry measure of a convex body $S\subset\mathbb{R}^n$ is given by: $\mathrm{sym}(S):=\max\{α\ge0:\text{ there exists }x\in S\text{ such that }-α(S-x)\subseteq S-x\}$, where such an $x$ is called a Minkowski center. We prove that every convex body $S$ admits a $\sqrt{\frac{n}{\mathrm{sym}(S)}}$-rounding of $S$, namely, there exists an origin-centered ellipsoid $E$ and a center $c$ such that $E\subseteq S-c\subseteq\sqrt{\frac{n}{\mathrm{sym}(S)}}\,E$. This result was conjectured in 2005 by Belloni and Freund. As special cases, this recovers an $n$-rounding of $S$ (since $\mathrm{sym}(S)\ge\frac{1}{n}$), and a $\sqrt{n}$-rounding when $\mathrm{sym}(S)=1$. In the case when $S$ is a polytope given as the convex hull of points, the desired rounding is produced by a regularized minimum-volume covering ellipsoid problem where the regularization is with respect to the Minkowski center. Similarly, when $S$ is a polytope given as the intersection of halfspaces, such a rounding is produced by a regularized maximum-volume inscribed ellipsoid problem. In both of these cases, the rounding can be computed by first solving a linear optimization problem (to compute $\mathrm{sym}(S)$ and a Minkowski center), and then solving a convex optimization problem with a logarithmic determinant objective, second-order cone constraints, and one semidefinite cone constraint. We also show that the factor $\sqrt{\frac{n}{\mathrm{sym}(S)}}$ is nearly tight in its dependence on dimension and symmetry. When $\frac{n+1}{1+\mathrm{sym}(S)}$ is an integer, we show by explicit construction that the factor $\sqrt{\frac{n}{\mathrm{sym}(S)}}$ is tight. In the more general case, for every dimension $n$ and every admissible symmetry value, we construct a polytope $S$ for which every rounding factor is at least $\sqrt{\frac{2}{3}}\sqrt{\frac{n}{\mathrm{sym}(S)}}$.

math.OC↗
arXiv2026

Improving the Last-Iterate Guarantees of Anytime Algorithms for Stochastic Monotone Variational Inequalities

We analyze a stochastic algorithm with Halpern-type anchoring for constrained convex-concave problems and monotone variational inequalities. This single-loop and single-call algorithm uses one unbiased sample of the gradient operator at every iteration, to be applicable to monotone games with noisy feedback. With $t$ denoting the iteration counter, we prove an anytime last-iterate convergence rate of $O(t^{-1/4})$ for both the gradient-mapping norm and restricted gap, bypassing the $O(t^{-1/5})$ constrained-anytime bottleneck in the literature. Specializing then to multi-point oracles, we use variance reduction to achieve the $O(t^{-1/2})$ rate with an anytime single-loop algorithm using $2$ samples per iteration. Our results allow constrained problems with a potentially unbounded feasible set; as well as a structured class of stochastic oracles whose variance need not be uniformly bounded.

math.OC↗