Award Abstract # 1839346
TRIPODS+X:RES: Collaborative Research: The Future of the Road - A Data-Driven Redesign of the Urban Transit Ecosystem

NSF Org: DMS
Division Of Mathematical Sciences
Recipient: CORNELL UNIVERSITY
Initial Amendment Date: September 10, 2018
Latest Amendment Date: September 10, 2018
Award Number: 1839346
Award Instrument: Standard Grant
Program Manager: Tracy Kimbrel
DMS
 Division Of Mathematical Sciences
MPS
 Directorate for Mathematical and Physical Sciences
Start Date: October 1, 2018
End Date: September 30, 2022 (Estimated)
Total Intended Award Amount: $425,000.00
Total Awarded Amount to Date: $425,000.00
Funds Obligated to Date: FY 2018 = $425,000.00
History of Investigator:
  • Siddhartha Banerjee (Principal Investigator)
    sbanerjee@cornell.edu
  • David Shmoys (Co-Principal Investigator)
  • Shane Henderson (Co-Principal Investigator)
  • Samitha Samaranayake (Co-Principal Investigator)
Recipient Sponsored Research Office: Cornell University
341 PINE TREE RD
ITHACA
NY  US  14850-2820
(607)255-5014
Sponsor Congressional District: 19
Primary Place of Performance: Cornell University
136 Hoy Road
Ithaca
NY  US  14853-3801
Primary Place of Performance
Congressional District:
19
Unique Entity Identifier (UEI): G56PUALJ3KT5
Parent UEI:
NSF Program(s): TRIPODS Transdisciplinary Rese,
Special Initiatives
Primary Program Source: 01001819DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 036E, 047Z, 062Z
Program Element Code(s): 041Y00, 164200
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.049

ABSTRACT

Providing efficient, cost-effective, and sustainable transportation solutions has long been a challenge for urban planners. Traditionally, urban mobility has been satisfied via either personal vehicle ownership or mass transit systems, neither of which is an optimal outcome (the former causes congestion and pollution, while the latter suffers from a lack of "last-mile" availability). On-demand transit modes - bikesharing, ridesharing, and micro-transit - have the potential to solve many of the challenges faced by cities. They scale naturally, can alleviate last-mile problems by providing coverage in lower density areas, and reduce incentives for car ownership. However, as they grow larger and intermingle with "classical" urban transit modes, the urban planner is forced to consider both their societal consequences and their effective integration. This project focuses on the following central question: How can we design an efficient and sustainable integrated transit ecosystem, that aligns the incentives of the individual commuter, providers of both on-demand and mass transit, and society as a whole?

To address the above challenges, the investigators propose a combination of *operational* and *market-design* approaches, built around a data-driven stochastic-network model for transit system operations, and the view of a transit authority acting as a meta-platform mediating between commuters and transit providers. The first research thrust on *operations* focuses on the algorithmic challenges faced by upcoming on-demand transit platforms (micro-transit, dockless bikesharing), and also by platforms in integrating their services with the broader transit infrastructure. The second thrust focuses on *market design*, i.e., the economic challenges of an integrated ecosystem. In particular, the investigators propose a number of contractual models for how urban planners can effectively integrate on-demand transit. The investigators also plan to facilitate conversation between academics and representatives of public and private transit platforms by organizing a workshop in 2019 on the Future of Urban Transit.

This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

PUBLICATIONS PRODUCED AS A RESULT OF THIS RESEARCH

Note:  When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

(Showing: 1 - 10 of 23)
Paul, Alice and Freund, Daniel and Ferber, Aaron and Shmoys, David B. and Williamson, David P. "Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems" Mathematics of Operations Research , v.45 , 2020 https://doi.org/10.1287/moor.2019.1002 Citation Details
Alijani, Reza and Banerjee, Siddhartha and Gollapudi, Sreenivas and Kollias, Kostas and Munagala, Kamesh "The Segmentation-Thickness Tradeoff in Online Marketplaces" ACM SIGMETRICS performance evaluation review , v.3 , 2019 10.1145/3311089 Citation Details
Alijani, Reza and Banerjee, Siddhartha and Gollapudi, Sreenivas and Munagala, Kamesh and Wang, Kangning "Predict and Match: Prophet Inequalities with Uncertain Supply" SIGMETRICS '20: Abstracts of the 2020 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems , 2020 https://doi.org/10.1145/3393691.3394212 Citation Details
Archer, Christopher and Banerjee, Siddhartha and Cortez, Mayleen and Rucker, Carrie and Sinclair, Sean R. and Solberg, Max and Xie, Qiaomin and Lee Yu, Christina "ORSuite: Benchmarking Suite for Sequential Operations Models" ACM SIGMETRICS Performance Evaluation Review , v.49 , 2022 https://doi.org/10.1145/3512798.3512819 Citation Details
Banerjee, Siddhartha and Freund, Daniel "Uniform Loss Algorithms for Online Stochastic Decision-Making With Applications to Bin Packing" ACM SIGMETRICS Performance Evaluation Review , v.48 , 2020 https://doi.org/10.1145/3410048.3410050 Citation Details
Banerjee, Siddhartha and Freund, Daniel "Uniform Loss Algorithms for Online Stochastic Decision-Making With Applications to Bin Packing" SIGMETRICS '20: Abstracts of the 2020 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems , 2020 https://doi.org/10.1145/3393691.3394224 Citation Details
Eckman, David J. and Henderson, Shane G. and Pasupathy, Raghu "Redesigning a Testbed of Simulation-Optimization Problems and Solvers for Experimental Comparisons" 2019 Winter Simulation Conference (WSC) , 2019 https://doi.org/10.1109/WSC40007.2019.9004860 Citation Details
Eckman, David J. and Henderson, Shane G. and Shashaani, Sara "Diagnostic Tools for Evaluating and Comparing Simulation-Optimization Algorithms" INFORMS Journal on Computing , 2023 https://doi.org/10.1287/ijoc.2022.1261 Citation Details
Frazier, Peter I. and Cashore, J. Massey and Duan, Ning and Henderson, Shane G. and Janmohamed, Alyf and Liu, Brian and Shmoys, David B. and Wan, Jiayue and Zhang, Yujia "Modeling for COVID-19 college reopening decisions: Cornell, a case study" Proceedings of the National Academy of Sciences , v.119 , 2022 https://doi.org/10.1073/pnas.2112532119 Citation Details
Freund, Daniel and Henderson, Shane G. and OMahony, Eoin and Shmoys, David B. "Analytics and Bikes: Riding Tandem with Motivate to Improve Mobility" INFORMS Journal on Applied Analytics , v.49 , 2019 https://doi.org/10.1287/inte.2019.1005 Citation Details
Freund, Daniel and Henderson, Shane G. and Shmoys, David B. "Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems" Operations Research , v.70 , 2022 https://doi.org/10.1287/opre.2022.2320 Citation Details
(Showing: 1 - 10 of 23)

PROJECT OUTCOMES REPORT

Disclaimer

This Project Outcomes Report for the General Public is displayed verbatim as submitted by the Principal Investigator (PI) for this award. Any opinions, findings, and conclusions or recommendations expressed in this Report are those of the PI and do not necessarily reflect the views of the National Science Foundation; NSF has not approved or endorsed its content.

The high-level aim of this project was to study the design of an efficient and sustainable integrated transit ecosystem - one that aligns the incentives of the individual commuter, providers of both on-demand and mass transit, and society as a whole. This is a critical question for determining the shape of the transport infrastructure of the future, especially with increased use of mobile apps and real-time data, and the growth of on-demand transportation services like Lyft, Citibike, Uber, Via, etc. To address these challenges, our proposal aimed to investigate a combination of operational and market-design approaches, built around new data-driven models for transit system operations, and a new economic viewpoint of a transit authority acting as a meta-platform mediating between commuters and transit providers.

The work on this grant has established new theoretical foundations for the design of on-demand transportation systems with potential applications in real-world systems, new simulation tools and platforms for testing these models and algorithms, and also practical implementation of resulting algorithms by our partners Citibike and Lyft. The project team continues to work with both industry and public sector partners in trying to incorporate theoretical advances in practice. In particular, below we highlight four representative technical results achieved as part of work done on this grant:

1. New algorithms for allocating docks and bikes in dock-based bikesharing systems. These algorithms were implemented by our partner Citibike, leading to repositioning of 100s of docks in Chicago and New York, and yielding improvements of up to 20% in comparison to their older allocation. (Allocating Capacity in Bikesharing Systems - Freund, Henderson and Shmoys)

2. New policies for online decision-making based on using prediction and simulation, which in particular provide the first constant additive-loss online policies for online matching and packing. These are fundamental primitives for a variety of online scheduling and routing problems, and the new results are highly significant in practice as the policies are much simpler, and also much better than the existing state-of-the-art. (The Bayesian Prophet: A Low-Regret Framework for Online Decision Making - Vera and Banerjee).

3. New methods for predicting the running time of ranking and selection procedures for stochastic optimization, leading to improved point-estimates of the problem configuration and the running time. These ideas have influenced work done with Lyft in using simulation optimization to better improve fleet management. (Predicting the Simulation Budget in Ranking and Selection Procedures - Ma and Henderson)

4. New algorithms for large-scale transit system redesign, incorporating demand responsive mass transit modes, and first-last mile ridesharing integration. Our results provide an efficient algorithm for this generalization of the transit line-planning problem along with an approximation guarantee. The code and algorithms have been made publicly available at https://github.com/SmartTransit-Cornell. (Real-Time Approximate Routing for Smart Transit Systems - Perivier, Hssaine, Samaranayake, Banerjee).

The work done on this project has been widely disseminated in various INFORMS and ACM venues, and resulted in several awards for the PIs and students, including the 2018 George B. Dantzig Dissertation Award (for Daniel Freund), the 2018 Daniel H. Wagner Prize for Excellence in Operations Research (for PIs Shmoys and Henderson and for Daniel Freund),  NSF CAREER awards (for PIs Banerjee and Samaranayake), and the 2022 Applied Probability Society Erlang Prize (for PI Banerjee). In addition, several graduate students and postdocs involved in this project have gone on to start as tenure-track faculty (including Daniel Freund at MIT Sloan. Raga Gopalakrishnan at Queens University, Qi Luo at Clemson, Chamsi Hssaine at USC Marshall, and Sean Sinclair at Northwestern IEMS). 


Last Modified: 02/28/2023
Modified by: Samitha Samaranayake

Please report errors in award information by writing to: awardsearch@nsf.gov.

Print this page

Back to Top of page