SearcharxivSearch

arXiv · 2301.00916

Individual Path Recommendation Under Public Transit Service Disruptions Considering Behavior Uncertainty

Abstract

Public transit passengers need guidance during service disruptions. This study proposes an individual-based path (IPR) recommendation model. The model decides which paths to recommend for each passenger with the objective of minimizing system travel time and respecting passengers' path choice preferences. We assume the recommendations could affect passengers' path choice probabilities, but their actual choices are uncertain. This behavior uncertainty makes the problem a stochastic optimization with decision-dependent distributions. We propose a single-point approximation method to eliminate the expectation operator by introducing two new concepts: epsilon-feasibility and Gamma-concentration, which control the mean and variance of path flows in the optimization problem. The approximation yields a tractable single-stage mixed integer linear formulation, which can be solved efficiently with Benders decomposition. The approximation gap is approved to be bounded from the above. Additional theoretical analysis shows that epsilon-feasibility and Gamma-concentration are strongly connected to expectation and chance constraints in a typical stochastic optimization formulation, respectively. The model is implemented in a real-world case study using data from an urban rail disruption in the Chicago Transit Authority system, and a synthetic case study with varied network sizes and incident locations. In the real-world case study, results show that the proposed IPR model reduces the average travel times in the system by 6.6% compared to the status quo and by 4.2% compared to a capacity-based benchmark model. In the synthetic case study, the proposed model shows 15.0% to 1.8% lower system travel time compared to the capacity-based benchmark, depending on the network sizes and demand situations.

Explore related subjects

Keep this discovery

BibTeXRIS

Baichuan Mo, Haris N. Koutsopoulos, Zuo-Jun Max Shen, Jinhua Zhao. 2023-01-03. Individual Path Recommendation Under Public Transit Service Disruptions Considering Behavior Uncertainty. https://arxiv.org/abs/2301.00916

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