Bibliographic Details
| Title: |
A stable matching model for long-term carpooling. |
| Authors: |
Jiang, Yanping1 (AUTHOR), Zheng, Tingwen1 (AUTHOR) tw.zheng@outlook.com, Tang, Zhenpeng2 (AUTHOR), Huang, Kunyuan1 (AUTHOR), Gao, Zhan1 (AUTHOR) |
| Source: |
Annals of Operations Research. Oct2025, Vol. 353 Issue 3, p949-976. 28p. |
| Subjects: |
Matching theory, Carpools, Mixed integer linear programming, Decomposition method, Travelers, Simulation methods & models, Heuristic algorithms |
| 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. [ABSTRACT FROM AUTHOR] |
|
Copyright of Annals of Operations Research is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
