A stable matching model for long-term carpooling

DOI10.1007/S10479-025-06805-3MaRDI QIDQ6880732zbMATH OpenFDO

Authors Yan-Ping Jiang, Tingwen Zheng, Zhenpeng Tang, Kunyuan Huang, Zhan Gao

Publication date 18 December 2025

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10479-025-06805-3

zbMATH Keywords

benders decompositioncarpoolinginteger programminglong-term carpoolingstable matching

Mathematics Subject Classification ID

Operations research and management science (90Bxx) Mathematical programming (90Cxx) Game theory (91Axx)

Cites work

• A cooperative game-theoretic approach to the social ridesharing problem
• A multi-agent based self-adaptive genetic algorithm for the long-term car pooling problem
• scientific article; zbMATH DE number 2159390 (Why is no real title available?)
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Modelling and analysis of online ride-sharing platforms -- a sustainability perspective
• Order assignment and scheduling under processing and distribution time uncertainty
• Partitioning procedures for solving mixed-variables programming problems
• Split-demand multi-trip vehicle routing problem with simultaneous pickup and delivery in airport baggage transit
• Tabu search for the real-world carpooling problem

This page was built for publication: A stable matching model for long-term carpooling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6880732)