skip to main content

Attention:

The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 11:00 PM ET on Friday, July 12 until 2:00 AM ET on Saturday, July 13 due to maintenance. We apologize for the inconvenience.


This content will become publicly available on December 27, 2024

Title: Estimating and Mitigating the Congestion Effect of Curbside Pick-ups and Drop-Offs: A Causal Inference Approach

Curb space is one of the busiest areas in urban road networks. Especially in recent years, the rapid increase of ride-hailing trips and commercial deliveries has induced massive pick-ups/drop-offs (PUDOs), which occupy the limited curb space that was designed and built decades ago. These PUDOs could jam curbside utilization and disturb the mainline traffic flow, evidently leading to significant negative societal externalities. However, there is a lack of an analytical framework that rigorously quantifies and mitigates the congestion effect of PUDOs in the system view, particularly with little data support and involvement of confounding effects. To bridge this research gap, this paper develops a rigorous causal inference approach to estimate the congestion effect of PUDOs on general regional networks. A causal graph is set to represent the spatiotemporal relationship between PUDOs and traffic speed, and a double and separated machine learning (DSML) method is proposed to quantify how PUDOs affect traffic congestion. Additionally, a rerouting formulation is developed and solved to encourage passenger walking and traffic flow rerouting to achieve system optimization. Numerical experiments are conducted using real-world data in the Manhattan area. On average, 100 additional units of PUDOs in a region could reduce the traffic speed by 3.70 and 4.54 miles/hour (mph) on weekdays and weekends, respectively. Rerouting trips with PUDOs on curb space could respectively reduce the system-wide total travel time (TTT) by 2.44% and 2.12% in Midtown and Central Park on weekdays. A sensitivity analysis is also conducted to demonstrate the effectiveness and robustness of the proposed framework.

Funding: The work described in this paper was supported by the National Natural Science Foundation of China [Grant 52102385], grants from the Research Grants Council of the Hong Kong Special Administrative Region, China [Grants PolyU/25209221 and PolyU/15206322], a grant from the Otto Poon Charitable Foundation Smart Cities Research Institute (SCRI) at the Hong Kong Polytechnic University [Grant P0043552], and a grant from Hong Kong Polytechnic University [Grant P0033933]. S. Qian was supported by a National Science Foundation Grant [Grant CMMI-1931827].

Supplemental Material: The e-companion is available at https://doi.org/10.1287/trsc.2022.0195 .

 
more » « less
Award ID(s):
1931827
NSF-PAR ID:
10482299
Author(s) / Creator(s):
; ; ;
Publisher / Repository:
INFORMS
Date Published:
Journal Name:
Transportation Science
ISSN:
0041-1655
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Although leveraged exchange-traded funds (ETFs) are popular products for retail investors, how to hedge them poses a great challenge to financial institutions. We develop an optimal rebalancing (hedging) model for leveraged ETFs in a comprehensive setting, including overnight market closure and market frictions. The model allows for an analytical optimal rebalancing strategy. The result extends the principle of “aiming in front of target” introduced by Gârleanu and Pedersen (2013) from a constant weight between current and future positions to a time-varying weight because the rebalancing performance is monitored only at discrete time points, but the rebalancing takes place continuously. Empirical findings and implications for the weekend effect and the intraday trading volume are also presented.

    This paper was accepted by Agostino Capponi, finance.

    Funding: M. Dai acknowledges support from the National Natural Science Foundation of China [Grant 12071333], the Hong Kong Polytechnic University [Grant P0039114], and the Singapore Ministry of Education [Grants R-146-000-243/306/311-114 and R-703-000-032-112]. H. M. Soner acknowledges partial support from the National Science Foundation [Grant DMS 2106462]. C. Yang acknowledges support from the Chinese University of Hong Kong [Grant 4055132 and a University Startup Grant].

    Supplemental Material: Data and the online supplement are available at https://doi.org/10.1287/mnsc.2022.4407 .

     
    more » « less
  2. We propose and study a new class of polynomial voting rules for a general decentralized decision/consensus system, and more specifically for the proof-of-stake protocol. The main idea, inspired by the Penrose square-root law and the more recent quadratic voting rule, is to differentiate a voter’s voting power and the voter’s share (fraction of the total in the system). We show that, whereas voter shares form a martingale process that converges to a Dirichlet distribution, their voting powers follow a supermartingale process that decays to zero over time. This prevents any voter from controlling the voting process and, thus, enhances security. For both limiting results, we also provide explicit rates of convergence. When the initial total volume of votes (or stakes) is large, we show a phase transition in share stability (or the lack thereof), corresponding to the voter’s initial share relative to the total. We also study the scenario in which trading (of votes/stakes) among the voters is allowed and quantify the level of risk sensitivity (or risk aversion) in three categories, corresponding to the voter’s utility being a supermartingale, a submartingale, and a martingale. For each category, we identify the voter’s best strategy in terms of participation and trading.

    Funding: W. Tang gratefully acknowledges financial support through the National Science Foundation [Grants DMS-2113779 and DMS-2206038] and through a start-up grant at Columbia University. D. D. Yao’s work is part of a Columbia–City University/Hong Kong collaborative project that is supported by InnoHK Initiative, the Government of Hong Kong Special Administrative Region, and the Laboratory for AI-Powered Financial Technologies.

     
    more » « less
  3. Since its publication, the authors of Wang et al. (2021) have brought to our attention an error in their article. A grant awarded by the National Science Foundation (grant no. MCB 1817985) to author Elizabeth Vierling was omitted from the Acknowledgements section. The correct Acknowledgements section is shown below. Acknowledgements We thank Suiwen Hou (Lanzhou University) and Zhaojun Ding (Shandong University) for providing the seeds used in this study. We thank Xiaoping Gou (Lanzhou University) and Ravishankar Palanivelu (University of Arizona) for critically reading the manuscript and for suggestions regarding the article. This work was supported by grants from National Natural Science Foundation of China (31870298) to SX, the US Department of Agriculture (USDA-CSREES-NRI-001030) and the National Science Foundation (MCB 1817985) to EV, and the Youth 1000-Talent Program of China (A279021801) to LY. 
    more » « less
  4. We characterize heavy-traffic process and steady-state limits for systems staffed according to the square-root safety rule, when the service requirements of the customers are perfectly correlated with their individual patience for waiting in queue. Under the usual many-server diffusion scaling, we show that the system is asymptotically equivalent to a system with no abandonment. In particular, the limit is the Halfin-Whitt diffusion for the [Formula: see text] queue when the traffic intensity approaches its critical value 1 from below, and is otherwise a transient diffusion, despite the fact that the prelimit is positive recurrent. To obtain a refined measure of the congestion due to the correlation, we characterize a lower-order fluid (LOF) limit for the case in which the diffusion limit is transient, demonstrating that the queue in this case scales like [Formula: see text]. Under both the diffusion and LOF scalings, we show that the stationary distributions converge weakly to the time-limiting behavior of the corresponding process limit. Funding: This work was supported by the National Natural Science Foundation of China [Grant 72188101] and the Division of Civil, Mechanical and Manufacturing Innovation [Grants 1763100 and 2006350]. 
    more » « less
  5. We study systemic risk in a supply chain network where firms are connected through purchase orders. Firms can be hit by cost or demand shocks, which can cause defaults. These shocks propagate through the supply chain network via input-output linkages between buyers and suppliers. Firms endogenously take contingency plans to mitigate the impact generated from disruptions. We show that, as long as firms have large initial equity buffers, network fragility is low if both buyer diversification and supplier diversification are low. We find that a single-sourcing strategy is beneficial for a firm only if the default probability of the firm’s supplier is low. Otherwise, a multiple-sourcing strategy is ex post more cost effective for a firm. Funding: J.R. Birge acknowledges financial support from the University of Chicago Booth School of Business. The research of A. Capponi has been supported by the NSF/CMMI CAREER-1752326 award. P.-C. Chen acknowledges financial support from the Research Grant Council of Hong Kong [Early Career Scheme Grant 27210118]. Supplemental Material: The e-companion is available at https://doi.org/10.1287/opre.2022.2409 . 
    more » « less