Regulating Mobility-on-Demand Services: Tri-level Model and Bayesian Optimization Solution Approach
Florian Dandl, Roman Engelhardt, Michael Hyland, Gabriel Tilg, Klaus, Bogenberger, Hani S. Mahmassani

TL;DR
This paper develops a tri-level model integrating regulators, mobility service providers, and travelers, using Bayesian optimization and agent-based simulation to optimize policies for mobility-on-demand services, demonstrated through a Munich case study.
Contribution
It introduces a novel tri-level mathematical programming framework combined with Bayesian optimization and agent-based simulation for policy analysis of mobility-on-demand services.
Findings
Optimal tolls and parking costs improve social welfare.
Shared-ride AMOD services add significant value to travelers.
Policy recommendations vary based on social welfare definitions.
Abstract
The goal of this paper is to develop a modeling framework that captures the inter-decision dynamics between mobility service providers (MSPs) and travelers that can be used to optimize and analyze policies/regulations related to MSPs. To meet this goal, the paper proposes a tri-level mathematical programming model with a public-sector decision maker (regulator) at the highest level, the MSP in the middle level, and travelers at the lowest level. The regulator aims to maximize social welfare via implementing regulations, policies, plans, transit service designs, etc. The MSP aims to maximize profit by adjusting its service designs. Travelers aim to maximize utility by changing their modes and routes. The travelers' decisions depend on the regulator and MSP's decisions while the MSP decisions themselves depend on the regulator's decisions. To solve the tri-level mathematical program, the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
