Estimating road traffic impacts of commute mode shifts.

This work considers the sensitivity of commute travel times in US metro areas due to potential changes in commute patterns, for example caused by events such as pandemics. Permanent shifts away from transit and carpooling can add vehicles to congested road networks, increasing travel times. Growth in the number of workers who avoid commuting and work from home instead can offset travel time increases. To estimate these potential impacts, 6-9 years of American Community Survey commute data for 118 metropolitan statistical areas are investigated. For 74 of the metro areas, the average commute travel time is shown to be explainable using only the number of passenger vehicles used for commuting. A universal Bureau of Public Roads model characterizes the sensitivity of each metro area with respect to additional vehicles. The resulting models are then used to determine the change in average travel time for each metro area in scenarios when 25% or 50% of transit and carpool users switch to single occupancy vehicles. Under a 25% mode shift, areas such as San Francisco and New York that are already congested and have high transit ridership may experience round trip travel time increases of 12 minutes (New York) to 20 minutes (San Francisco), costing individual commuters $1065 and $1601 annually in lost time. The travel time increases and corresponding costs can be avoided with an increase in working from home. The main contribution of this work is to provide a model to quantify the potential increase in commute travel times under various behavior changes, that can aid policy making for more efficient commuting.

Safe reopening of university campuses is possible with COVID-19 vaccination.

We construct an agent-based SEIR model to simulate COVID-19 spread at a 16000-student mostly non-residential urban university during the Fall 2021 Semester. We find that mRNA vaccine coverage at 100% combined with weekly screening testing of 25% of the campus population make it possible to safely reopen to in-person instruction. Our simulations exhibit a right-skew for total infections over the semester that becomes more pronounced with less vaccine coverage, less vaccine effectiveness and no additional preventative measures. This suggests that high levels of infection are not exceedingly rare with campus social connections the main transmission route. Finally, we find that if vaccine coverage is 100% and vaccine effectiveness is above 80%, then a safe reopening is possible even without facemask use. This models possible future scenarios with high coverage of additional "booster" doses of COVID-19 vaccines.

Managing public transit during a pandemic: The trade-off between safety and mobility.

During a pandemic such as COVID-19, managing public transit effectively becomes a critical policy decision. On the one hand, efficient transportation plays a pivotal role in enabling the movement of essential workers and keeping the economy moving. On the other hand, public transit can be a vector for disease propagation due to travelers' proximity within shared and enclosed spaces. Without strategic preparedness, mass transit facilities are potential hotbeds for spreading infectious diseases. Thus, transportation agencies face a complex trade-off when developing context-specific operating strategies for public transit. This work provides a network-based analysis framework for understanding this trade-off, as well as tools for calculating targeted commute restrictions under different policy constraints, e.g., regarding public health considerations (limiting infection levels) and economic activity (limiting the reduction in travel). The resulting plans ensure that the traffic flow restrictions imposed on each route are adaptive to the time-varying epidemic dynamics. A case study based on the COVID-19 pandemic reveals that a well-planned subway system in New York City can sustain 88% of transit flow while reducing the risk of disease transmission by 50% relative to fully-loaded public transit systems. Transport policy-makers can exploit this optimization-based framework to address safety-and-mobility trade-offs and make proactive transit management plans during an epidemic outbreak.

Bounded Asymmetry in Road Networks.

Road networks are a classical stage for applications in network science and graph theory. Meanwhile, many combinatorial problems that arise in road networks are computationally intractable. Thus, an attractive way of tackling them is through efficient heuristics with provable performance guarantees, better known as approximation algorithms. This motivates the intersection of algorithm design with the aforementioned fields. Specifically, identifying measures that characterize graphs and exploiting them in the design of algorithms may yield practical heuristics with rigorous mathematical justification. Herein, we propose a new graph measure, namely the asymmetry factor ΔG of a directed graph G, with immediate algorithmic results via a symmetrization procedure and the black box use of approximation algorithms for symmetric graphs. Crucially, we analyze the asymmetry factors of the road networks from a diverse set of twelve cities, providing empirical evidence that road networks exhibit low bounded asymmetry and thereby justifying the practical use of algorithms for symmetric graphs.

On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment.

Ride-sharing services are transforming urban mobility by providing timely and convenient transportation to anybody, anywhere, and anytime. These services present enormous potential for positive societal impacts with respect to pollution, energy consumption, congestion, etc. Current mathematical models, however, do not fully address the potential of ride-sharing. Recently, a large-scale study highlighted some of the benefits of car pooling but was limited to static routes with two riders per vehicle (optimally) or three (with heuristics). We present a more general mathematical model for real-time high-capacity ride-sharing that (i) scales to large numbers of passengers and trips and (ii) dynamically generates optimal routes with respect to online demand and vehicle locations. The algorithm starts from a greedy assignment and improves it through a constrained optimization, quickly returning solutions of good quality and converging to the optimal assignment over time. We quantify experimentally the tradeoff between fleet size, capacity, waiting time, travel delay, and operational costs for low- to medium-capacity vehicles, such as taxis and van shuttles. The algorithm is validated with ∼3 million rides extracted from the New York City taxicab public dataset. Our experimental study considers ride-sharing with rider capacity of up to 10 simultaneous passengers per vehicle. The algorithm applies to fleets of autonomous vehicles and also incorporates rebalancing of idling vehicles to areas of high demand. This framework is general and can be used for many real-time multivehicle, multitask assignment problems.