SearcharxivSearch

arXiv · 2211.13414

Exploring the drive-by sensing power of bus fleet through active scheduling

Abstract

Vehicle-based mobile sensing (a.k.a drive-by sensing) is an important means of surveying urban environment by leveraging the mobility of public or private transport vehicles. Buses, for their extensive spatial coverage and reliable operations, have received much attention in drive-by sensing. Existing studies have focused on the assignment of sensors to a set of lines or buses with no operational intervention, which is typically formulated as set covering or subset selection problems. This paper aims to boost the sensing power of bus fleets through active scheduling, by allowing instrumented buses to circulate across multiple lines to deliver optimal sensing outcome. We consider a fleet consisting of instrumented and normal buses, and jointly optimize sensor assignment, bus dispatch, and intra- or inter-line relocations, with the objectives of maximizing sensing quality and minimizing operational costs, while serving all timetabled trips. By making general assumptions on the sensing utility function, we formulate the problem as a nonlinear integer program based on a time-expanded network. A batch scheduling algorithm is developed following linearization techniques to solve the problem efficiently, which is tested in a real-world case study in Chengdu, China. The results show that the proposed scheme can improve the sensing objective by 12.0%-20.5% (single-line scheduling) and 16.3%-32.1% (multi-line scheduling), respectively, while managing to save operational costs by 1.0%. Importantly, to achieve the same level of sensing quality, we found that the sensor investment can be reduced by over 33% when considering active bus scheduling. Comprehensive comparative and sensitivity analyses are presented to generate managerial insights and recommendations for practice.

Explore related subjects

Keep this discovery

BibTeXRIS

Dai Zhuang, Ke Han. 2022-11-24. Exploring the drive-by sensing power of bus fleet through active scheduling. https://arxiv.org/abs/2211.13414

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

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC