Stable matching mechanism for multi-modal integration on mobility-as-a-service platform

Yating WU , Minghui LAI

Journal of Southeast University (English Edition) ›› 2026, Vol. 42 ›› Issue (2) : 250 -256.

PDF (521KB)
Journal of Southeast University (English Edition) ›› 2026, Vol. 42 ›› Issue (2) :250 -256. DOI: 10.3969/j.issn.1003-7985.2026.02.012
research-article
Stable matching mechanism for multi-modal integration on mobility-as-a-service platform
Author information +
History +
PDF (521KB)

Abstract

In mobility-as-a-service (MaaS) platforms integrating ridesharing with public transit, each rider-driver pair may have multiple potential matches via different transfer nodes, with users being self-interested with heterogeneous preferences. After generating all feasible integrated matches, a two-sided one-to-one stable matching model is formulated to maximize platform revenue, where each feasible match corresponds to a stability constraint embedding preference information. To solve this model efficiently, an iterative constraint-generation algorithm is designed. It repeatedly solves a restricted master problem to obtain a temporary solution and a subproblem to identify violated stability constraints, iterating until no violations remain. The proposed algorithm can significantly improve computational efficiency. Compared with a centralized matching benchmark with the blocking rate up to 75%, stable matching increases transit usage and user acceptance at the cost of a 31.43% reduction in average platform revenue. Riders experience longer detours with greater cost savings, whereas drivers exhibit the opposite pattern.

Keywords

mobility as a service / stable matching / constraint generation / ridesharing / public transit

Cite this article

Download citation ▾
Yating WU, Minghui LAI. Stable matching mechanism for multi-modal integration on mobility-as-a-service platform. Journal of Southeast University (English Edition), 2026, 42 (2) : 250-256 DOI:10.3969/j.issn.1003-7985.2026.02.012

登录浏览全文

4963

注册一个新账户 忘记密码

References

[1]

JITTRAPIROM P, CAIATI V, FENERI A M, et al. Mobility as a service: A critical review of definitions, assessments of schemes, and key challenges[J]. Urban Planning, 2017, 2(2): 13-25.

[2]

HEIKKILÄ S. Mobility as a service: A proposal for action for the public administration, case Helsinki[D]. Helsinki, Finland: Aalto University, 2014.

[3]

WRIGHT S, NELSON J D, COTTRILL C D. MaaS for the suburban market: Incorporating carpooling in the mix[J]. Transportation Research Part A: Policy and Practice, 2020, 131: 206-218.

[4]

WANG Q C, JANNICKE H B, SEBASTIAAN M. The complexity of stakeholder influence on MaaS: A study on multi-stakeholder perspectives in Shenzhen self-driving mini-bus case[J]. Research in Transportation Economics, 2022, 94: 101070.

[5]

SHEN J X, LI Q N, YU M, et al. Group effect analysis of factors influencing subway passenger satisfaction from a travel chain perspective[J]. Journal of Southeast University (Natural Science Edition), 2025, 55(4): 1165-1172. (in Chinese)

[6]

LU R Y, GUO X C, LI J C, et al. Tourist travel behavior in rural areas considering bus route preferences[J]. Journal of Southeast University (English Edition), 2023, 39(1).

[7]

WANG X, AGATZ N, ERERA A. Stable matching for dynamic ride-sharing systems[J]. Transportation Science, 2017, 52(4): 850-867.

[8]

SONG X Q, ZHANG W J, LEI L, et al. Dynamic resource allocation algorithm for multi-objective joint optimization in Internet of vehicle[J]. 2025, 55(1): 266-274. (in Chinese)

[9]

UTRIAINEN R, PÖLLÄNEN M. Review on mobility as a service in scientific publications[J]. Research in Transportation Business & Management, 2018, 27: 15-23.

[10]

LYONS G, HAMMOND P, MACKAY K. The importance of user perspective in the evolution of MaaS[J]. Transportation Research Part A: Policy and Practice, 2019, 121: 22-36.

[11]

STIGLIC M, AGATZ N, SAVELSBERGH M, et al. Enhancing urban mobility: Integrating ride-sharing and public transit[J]. Computers & Operations Research, 2018, 90: 12-21.

[12]

KUMAR P, KHANI A. An algorithm for integrating peer-to-peer ridesharing and schedule-based transit system for first mile/last mile access[J]. Transportation Research Part C: Emerging Technologies, 2021, 122: 102891.

[13]

GALE D, SHAPLEY L S. College admissions and the stability of marriage[J]. The American Mathematical Monthly, 1962, 69(1): 9-15.

[14]

ROTH A E, SOTOMAYOR M. Chapter 16 two-sided matching[M]. Amsterdam, the Netherlands: Elsevier, 1992: 485-541.

[15]

VANDE VATE J H. Linear programming brings marital bliss[J]. Operations Research Letters, 1989, 8(3): 147-153.

[16]

ROTHBLUM U G. Characterization of stable matchings as extreme points of a polytope[J]. Mathematical Programming, 1992, 54(1): 57-67.

[17]

FENG S Y, DUAN P B, KE J T, et al. Coordinating ride-sourcing and public transport services with a reinforcement learning approach[J]. Transportation Research Part C: Emerging Technologies, 2022, 138: 103611.

[18]

Dida Chuxing. The convention rules of Dida Chuxing[EB/OL]. (2024-12-24)[2025-05-24]. http://www.didachuxing.com/homepage/carpool/convention. (in Chinese)

[19]

Didi Chuxing. KDD Cup 2020 dataset[EB/OL]. (2020-06-11)[2025-05-24]. https://outreach.didichuxing.com/app-vue/KDD_CUP_2020id=1004. (in Chinese)

[20]

AMap. Route planning API document[EB/OL]. (2025-02-14)[2025-05-24]. https://lbs.amap.com/api/webservice/guide/api/direction. (in Chinese)

Funding

National Natural Science Foundation of China(72231002)

National Natural Science Foundation of China(72371070)

PDF (521KB)

0

Accesses

0

Citation

Detail

Sections
Recommended

/