How would mobility-as-a-service (MaaS) platform survive as an intermediary? From the viewpoint of stability in many-to-many matching (2310.08285v1)
Abstract: Mobility-as-a-service (MaaS) provides seamless door-to-door trips by integrating different transport modes. Although many MaaS platforms have emerged in recent years, most of them remain at a limited integration level. This study investigates the assignment and pricing problem for a MaaS platform as an intermediary in a multi-modal transportation network, which purchases capacity from service operators and sells multi-modal trips to travelers. The analysis framework of many-to-many stable matching is adopted to decompose the joint design problem and to derive the stability condition such that both operators and travelers are willing to participate in the MaaS system. To maximize the flexibility in route choice and remove boundaries between modes, we design an origin-destination pricing scheme for MaaS trips. On the supply side, we propose a wholesale purchase price for service capacity. Accordingly, the assignment problem is reformulated and solved as a bi-level program, where MaaS travelers make multi-modal trips to minimize their travel costs meanwhile interacting with non-MaaS travelers in the multi-modal transport system. We prove that, under the proposed pricing scheme, there always exists a stable outcome to the overall many-to-many matching problem. Further, given an optimal assignment and under some mild conditions, a unique optimal pricing scheme is ensured. Numerical experiments conducted on the extended Sioux Falls network also demonstrate that the proposed MaaS system could create a win-win-win situation -- the MaaS platform is profitable and both traveler welfare and transit operator revenues increase from a baseline scenario without MaaS.
- Maximal monotone maps and variational inequalities. Asymptotic Cones and Functions in Optimization and Variational Inequalities, pages 183–232.
- Bar-Gera (2016). Transportation networks for research.
- User-equilibrium route flows and the condition of proportionality. Transportation Research Part B: Methodological, 46(3):440–462.
- Connecting e-hailing to mass transit platform: Analysis of relative spatial position. Transportation Research Part C: Emerging Technologies, 77:444–461.
- Ridesharing user equilibrium with nodal matching cost and its implications for congestion tolling and platform pricing. Transportation Research Part C: Emerging Technologies, 129:103233.
- A theory of production.
- A three-operator splitting scheme and its optimization applications. Set-valued and variational analysis, 25:829–858.
- Transit assignment for congested public transport systems: an equilibrium model. Transportation science, 27(2):133–147.
- Incentive design and profit sharing in multi-modal transportation networks. Transportation Research Part B: Methodological, 163:1–21.
- A unified equilibrium framework of new shared mobility systems. Transportation Research Part B: Methodological, 129:50–78.
- Mechanism design for mobility-as-a-service platform considering travelers’ strategic behavior and multidimensional requirements. Transportation Research Part B: Methodological, 173:1–30.
- Finite-dimensional variational inequalities and complementarity problems. Springer.
- On uniqueness and proportionality in multi-class equilibrium assignment. Transportation Research Part B: Methodological, 70:173–185.
- College admissions and the stability of marriage. The American Mathematical Monthly, 69(1):9–15.
- Existence of optimal solutions to mathematical programs with equilibrium constraints. Operations research letters, 7(2):61–64.
- Mobility as a service: A critical review of definitions, assessments of schemes, and key challenges.
- A critical review of new mobility services for urban transport. Transportation Research Procedia, 14:3294–3303.
- Kanzow, C. (2016). On the multiplier-penalty-approach for quasi-variational inequalities. Mathematical Programming, 160:33–63.
- A capacity restraint transit assignment with elastic line frequency. Transportation Research Part B: Methodological, 36(10):919–938.
- Differentiable bilevel programming for stackelberg congestion games. arXiv preprint arXiv:2209.07618.
- On-demand mobility-as-a-service platform assignment games with guaranteed stable outcomes. arXiv preprint arXiv:2305.00818.
- End-to-end learning of user equilibrium with implicit neural networks. Transportation Research Part C: Emerging Technologies, 150:104085.
- Optimal design of intermodal mobility networks under uncertainty: Connecting micromobility with mobility-on-demand transit. EURO Journal on Transportation and Logistics, 10:100045.
- Multimodal mobility systems: joint optimization of transit network design and pricing. In Proceedings of the ACM/IEEE 12th International Conference on Cyber-Physical Systems, pages 121–131.
- Mohiuddin, H. (2021). Planning for the first and last mile: A review of practices at selected transit agencies in the united states. Sustainability, 13(4):2222.
- Nagurney, A. (2006). On the relationship between supply chain and transportation network equilibria: A supernetwork equivalence with computations. Transportation Research Part E: Logistics and Transportation Review, 42(4):293–316.
- A supply chain network equilibrium model. Transportation Research Part E: Logistics and Transportation Review, 38(5):281–303.
- Models and algorithms for the traffic assignment problem with link capacity constraints. Transportation Research Part B: Methodological, 38(4):285–312.
- A many-to-many assignment game and stable outcome algorithm to evaluate collaborative mobility-as-a-service platforms. Transportation Research Part B: Methodological, 140:79–100.
- Proximal algorithms. Foundations and trends® in Optimization, 1(3):127–239.
- Patriksson, M. (2004). Sensitivity analysis of traffic equilibria. Transportation Science, 38(3):258–281.
- Joint design of multimodal transit networks and shared autonomous mobility fleets. Transportation Research Part C: Emerging Technologies, 113:2–20.
- Route-cost-assignment with joint user and operator behavior as a many-to-one stable matching assignment game. Transportation Research Part B: Methodological, 124:60–81.
- Maas bundle design. Transportation Research Part A: Policy and Practice, 141:485–501.
- Mobility and the sharing economy: Potential to facilitate the first-and last-mile public transit connections. Built Environment, 42(4):573–588.
- Sotomayor, M. (1992). The multiple partners game. In Equilibrium and dynamics, pages 322–354. Springer.
- Enhancing urban mobility: Integrating ride-sharing and public transit. Computers & Operations Research, 90:12–21.
- On the importance of initialization and momentum in deep learning. In International conference on machine learning, pages 1139–1147. PMLR.
- Transit assignment: Approach-based formulation, extragradient method, and paradox. Transportation Research Part B: Methodological, 62:51–76.
- Sensitivity analysis for equilibrium network flow. Transportation Science, 22(4):242–250.
- Tseng, P. (2001). Convergence of a block coordinate descent method for nondifferentiable minimization. Journal of optimization theory and applications, 109:475–494.
- Business models for mobility as an service (maas). Transportation Research Part B: Methodological, 157:203–229.
- New potential for multimodal connection: Exploring the relationship between taxi and transit in new york city (nyc). Transportation, 46(3):1051–1072.
- Approximating the performance of a “last mile” transportation system. Transportation Science, 50(2):659–675.
- A survey of distributed optimization. Annual Reviews in Control, 47:278–305.
- A general equilibrium model for multi-passenger ridesharing systems with stable matching. Transportation Research Part B: Methodological, 175:102775.
- How many are too many? analyzing dockless bikesharing systems with a parsimonious model. Analyzing Dockless Bikesharing Systems with a Parsimonious Model (September 8, 2021).