IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v353y2025i3d10.1007_s10479-025-06805-3.html
   My bibliography  Save this article

A stable matching model for long-term carpooling

Author

Listed:
  • Yanping Jiang

    (Northeastern University)

  • Tingwen Zheng

    (Northeastern University)

  • Zhenpeng Tang

    (Xinjiang University)

  • Kunyuan Huang

    (Northeastern University)

  • Zhan Gao

    (Northeastern University)

Abstract

Long-term carpooling is a convenient and stable way for demanders who travel to their destinations for a long time and have similar travel time. How to match drivers and riders effectively is a very important problem in long-term carpooling. This paper proposes a stable matching method for long-term carpooling. Firstly, the stable matching problem of long-term carpooling is described, and the relevant definitions of stable matching are given. Secondly, a mixed-integer programming model is constructed with the objective of maximizing the total utility. Then, a heuristic algorithm based on knowledge rules and Benders decomposition is proposed. Finally, numerical experiments on different scales validate the feasibility and effectiveness of the proposed method. The results show that the price of stability is relatively small compared with system optimum. On this basis, we explore how certain parameters such as the stability constraints, objective function, cost-sharing method, vehicle capacity and maximum detour ratio, might affect the matching scheme.

Suggested Citation

  • Yanping Jiang & Tingwen Zheng & Zhenpeng Tang & Kunyuan Huang & Zhan Gao, 2025. "A stable matching model for long-term carpooling," Annals of Operations Research, Springer, vol. 353(3), pages 949-976, October.
    • Handle: RePEc:spr:annopr:v:353:y:2025:i:3:d:10.1007_s10479-025-06805-3
    DOI: 10.1007/s10479-025-06805-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-025-06805-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-025-06805-3?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:spr:annopr:v:353:y:2025:i:3:d:10.1007_s10479-025-06805-3. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.