IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v211y2026ics0191261526001438.html

Mitigating network traffic congestion via link- and path-based incentives

Author

Listed:
  • Niroumand, Ramin
  • Vosough, Shaghayegh
  • Kafashan, Fahim
  • Roncoli, Claudio
  • Rinaldi, Marco
  • Connors, Richard D.

Abstract

This study investigates the potential of link- and path-based incentives to mitigate congestion in urban transportation networks under a budget constraint. Both incentive schemes are formulated as non-linear optimisation problems with complementarity constraints. Mathematically, it is demonstrated that the feasible region of the link-based model is a subset of the feasible region of the path-based model under the same budget constraint. Consequently, path-based incentives exhibit greater potential to shift the user equilibrium flow pattern toward the system optimum compared to link incentives. A column generation-based iterative solution technique, which generates new paths at each iteration, is devised to efficiently solve both optimisation problems. Numerical experiments conducted for various transport networks also highlight the efficiency and scalability of the proposed algorithm, and the superiority of path-based incentives in reducing total travel time in urban transportation networks.

Suggested Citation

  • Niroumand, Ramin & Vosough, Shaghayegh & Kafashan, Fahim & Roncoli, Claudio & Rinaldi, Marco & Connors, Richard D., 2026. "Mitigating network traffic congestion via link- and path-based incentives," Transportation Research Part B: Methodological, Elsevier, vol. 211(C).
    • Handle: RePEc:eee:transb:v:211:y:2026:i:c:s0191261526001438
    DOI: 10.1016/j.trb.2026.103531
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261526001438
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2026.103531?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:transb:v:211:y:2026:i:c:s0191261526001438. 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/548/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.