In this paper, we mathematically model the multi-hop Peer-to-Peer (P2P) ride-matching problem as a binary program. We formulate this problem as a many-to-many problem in which a rider can travel by transferring between multiple drivers, and a driver can carry multiple riders. We propose a pre-processing procedure to reduce the size of the problem, and devise a decomposition algorithm to solve the original ride-matching problem to optimality by means of solving multiple smaller problems. We conduct extensive numerical experiments to demonstrate the computational efficiency of the proposed algorithm and show its practical applicability to reasonably-sized dynamic ride-matching contexts. Finally, in the interest of even lower solution times, we propose heuristic solution methods, and investigate the trade-offs between solution time and accuracy.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A decomposition algorithm to solve the multi-hop Peer-to-Peer ride-matching problem


    Contributors:


    Publication date :

    2017




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English



    Classification :

    BKL:    55.80 Verkehrswesen, Transportwesen: Allgemeines




    Developing an Optimal Peer-to-Peer Ride-Matching Problem Algorithm with Ride Transfers

    Nickkar, Amirreza / Lee, Young-Jae / Meskar, Mana | Transportation Research Record | 2022



    Multi-party ride-matching problem in the ride-hailing market with bundled option services

    Qin, Xiaoran / Yang, Hai / Wu, Yinghui et al. | Elsevier | 2021