Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2606.31142

Augmenting airline networks using airside-to-airside buses to strengthen system resilience under disruptions

Micah M. Borrero·Max Z. Li
View original source ↗Read source document ↗Export metadata ↓

Abstract

Each year, disruptions in the air transportation network strand millions of passengers and cost airlines billions in revenue. Airline networks prioritize operational and cost efficiency through hub-and-spoke structures that maximize revenue; however, these hubs also act as critical choke points during disruptions. Previous studies have focused on reactionary measures in response to air transportation network disruptions, whereas this work proposes a proactive strategy to improve resilience by reconfiguring the network's topology. Specifically, we consider airside-to-airside bus lines as a low-cost, frequent alternative to short, regional flights, offering service that can circumvent air traffic-related delays. We develop a network construction model that augments the existing air transportation network with these bus lines. The augmented networks are analyzed through an agent-based simulation, where increased resilience is measured in terms of decreased average hourly passenger delays under both nominal and disrupted conditions. Our results demonstrate that converting 10 regional routes from air service to airside-to-airside bus service, for a baseline scenario that is constrained by a $10 million investment budget, can reduce passenger delays by an average of 8% on disrupted days and 6% on nominal days. Furthermore, through a sensitivity analysis, we show that while augmenting the system using these buses decreases operational costs compared to the historic air-only network, continuously expanding bus parameters (i.e., range and investment budget) yields diminishing returns in delay mitigation. Finally, we discuss real-world precedents alongside regulatory and political hurdles to implementation. The proposed framework offers airlines, airports, and regulators a decision-support tool for integrating multimodal strategies into future disruption management policies.

Explore related subjects

math.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Micah M. Borrero, Max Z. Li. 2026-06-30. Augmenting airline networks using airside-to-airside buses to strengthen system resilience under disruptions. https://arxiv.org/abs/2606.31142

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↗