Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2205.05324

A branch-cut-and-price algorithm for a dial-a-ride problem with minimum disease-transmission risk

Shuocheng Guo·Iman Dayarian·Jian Li·Xinwu Qian
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper investigates a variant of the dial-a-ride problem (DARP), namely Risk-aware DARP (RDARP). Our RDARP extends the DARP by (1) minimizing a weighted sum of travel cost and disease-transmission risk exposure for onboard passengers and (2) introducing a maximum cumulative exposure risk constraint for each vehicle to ensure a trip with lower external exposure. Both extensions require that the risk exposure of each onboard passenger is propagated in a minimized fashion while satisfying other existing constraints of the DARP. To fully describe the RDARP, we first provide a three-index arc-based formulation and reformulate the RDARP into an equivalent min-max trip-based formulation, which is solved by an exact Branch-Cut-and-Price (BCP) algorithm. For each node in the branching tree, we adopt the column generation method by decomposing the problem into a master problem and a subproblem. The latter takes the form of an elementary shortest path problem with resource constraints and minimized maximum risk (ESPPRCMMR). To solve the ESPPRCMMR efficiently, we develop a new labeling algorithm and establish families of resource extension functions in compliance with the risk-related resources. We adopt a real-world paratransit trip dataset to generate the RDARP instances ranging from 17 to 55 heterogeneous passengers with 3 to 13 vehicles during the morning and afternoon periods. Computational results show that our BCP algorithm can optimally solve all small- and medium-sized instances (32 or fewer passengers) within 5 minutes. For the large instances (39 to 55 passengers), our BCP algorithm can solve 23 of 30 instances optimally within a time limit of one hour.

Explore related subjects

math.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shuocheng Guo, Iman Dayarian, Jian Li, Xinwu Qian. 2023-08-06. A branch-cut-and-price algorithm for a dial-a-ride problem with minimum disease-transmission risk. https://arxiv.org/abs/2205.05324

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↗