Bilevel subsidy-enabled mobility hub network design with perturbed utility coalitional choice-based assignment
Hai Yang, Joseph Y. J. Chow
TL;DR
The paper tackles the challenge of designing subsidy-enabled mobility hubs within a Mobility-as-a-Service framework by formulating a bilevel model where a central platform sets traveler-facing prices and operator subsidies, while a lower-level PURC-based assignment captures the joint traveler–operator coalitional decisions. By reformulating the bilevel problem with KKT conditions and solving via a gap-penalty method with iterative warm-starts, the approach achieves high-quality solutions at realistic scales. The methodology is validated on a toy network and a large Long Island Rail Road (LIRR) case, revealing that MHs can significantly reduce travel disutility and that link-based subsidies offer granular control, with hub-based subsidies offering a different trade-off in computational effort and policy interpretation. The results provide actionable insights for policymakers and operators, such as the social surplus value of MHs, the impact of subsidy caps, and the importance of competition, while outlining avenues for extending the framework to richer supply-side dynamics and broader applications.
Abstract
Urban mobility is undergoing rapid transformation with the emergence of new services. Mobility hubs (MHs) have been proposed as physical-digital convergence points, offering a range of public and private mobility options in close proximity. By supporting Mobility-as-a-Service, these hubs can serve as focal points where travel decisions intersect with operator strategies. We develop a bilevel MH platform design model that treats MHs as control levers. The upper level (platform) maximizes revenue or flow by setting subsidies to incentivize last-mile operators; the lower level captures joint traveler-operator decisions with a link-based Perturbed Utility Route Choice (PURC) assignment, yielding a strictly convex quadratic program. We reformulate the bilevel problem to a single-level program via the KKT conditions of the lower level and solve it with a gap-penalty method and an iterative warm-start scheme that exploits the computationally cheap lower-level problem. Numerical experiments on a toy network and a Long Island Rail Road (LIRR) case (244 nodes, 469 links, 78 ODs) show that the method attains sub-1% optimality gaps in minutes. In the base LIRR case, the model allows policymakers to quantify the social surplus value of a MH, or the value of enabling subsidy or regulating the microtransit operator's pricing. Comparing link-based subsidies to hub-based subsidies, the latter is computationally more expensive but offers an easier mechanism for comparison and control.
