IDEAS home Printed from https://ideas.repec.org/a/eee/transa/v208y2026ics0965856426001138.html

Bilevel subsidy-enabled mobility hub network design with perturbed utility coalitional choice-based assignment

Author

Listed:
  • Yang, Hai
  • Chow, Joseph Y.J.

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 OD based pricing to travelers and 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 (380 nodes, 642 links, 78 ODs) show that the method attains sub-1% optimality gaps in less than 30 min. In the base LIRR case, the model allows policymakers to set the optimal platform access fee and operator subsidy. We then evaluate the impact of operator competition, quantify the social surplus value of a MH, and how restrictive subsidy can discourage operator participation.

Suggested Citation

  • Yang, Hai & Chow, Joseph Y.J., 2026. "Bilevel subsidy-enabled mobility hub network design with perturbed utility coalitional choice-based assignment," Transportation Research Part A: Policy and Practice, Elsevier, vol. 208(C).
  • Handle: RePEc:eee:transa:v:208:y:2026:i:c:s0965856426001138
    DOI: 10.1016/j.tra.2026.104972
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0965856426001138
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.tra.2026.104972?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transa:v:208:y:2026:i:c:s0965856426001138. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/547/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.