View in EDS

A stable matching model for long-term carpooling.

Saved in:
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
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 188949744
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A stable matching model for long-term carpooling.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Jiang%2C+Yanping%22">Jiang, Yanping</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Zheng%2C+Tingwen%22">Zheng, Tingwen</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> tw.zheng@outlook.com</i><br /><searchLink fieldCode="AR" term="%22Tang%2C+Zhenpeng%22">Tang, Zhenpeng</searchLink><relatesTo>2</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Huang%2C+Kunyuan%22">Huang, Kunyuan</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Gao%2C+Zhan%22">Gao, Zhan</searchLink><relatesTo>1</relatesTo> (AUTHOR)
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Annals+of+Operations+Research%22">Annals of Operations Research</searchLink>. Oct2025, Vol. 353 Issue 3, p949-976. 28p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Matching+theory%22">Matching theory</searchLink><br /><searchLink fieldCode="DE" term="%22Carpools%22">Carpools</searchLink><br /><searchLink fieldCode="DE" term="%22Mixed+integer+linear+programming%22">Mixed integer linear programming</searchLink><br /><searchLink fieldCode="DE" term="%22Decomposition+method%22">Decomposition method</searchLink><br /><searchLink fieldCode="DE" term="%22Travelers%22">Travelers</searchLink><br /><searchLink fieldCode="DE" term="%22Simulation+methods+%26+models%22">Simulation methods & models</searchLink><br /><searchLink fieldCode="DE" term="%22Heuristic+algorithms%22">Heuristic algorithms</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=188949744
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s10479-025-06805-3
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 28
        StartPage: 949
    Subjects:
      – SubjectFull: Matching theory
        Type: general
      – SubjectFull: Carpools
        Type: general
      – SubjectFull: Mixed integer linear programming
        Type: general
      – SubjectFull: Decomposition method
        Type: general
      – SubjectFull: Travelers
        Type: general
      – SubjectFull: Simulation methods & models
        Type: general
      – SubjectFull: Heuristic algorithms
        Type: general
    Titles:
      – TitleFull: A stable matching model for long-term carpooling.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Jiang, Yanping
      – PersonEntity:
          Name:
            NameFull: Zheng, Tingwen
      – PersonEntity:
          Name:
            NameFull: Tang, Zhenpeng
      – PersonEntity:
          Name:
            NameFull: Huang, Kunyuan
      – PersonEntity:
          Name:
            NameFull: Gao, Zhan
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 21
              M: 10
              Text: Oct2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 02545330
          Numbering:
            – Type: volume
              Value: 353
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Annals of Operations Research
              Type: main
ResultId 1