Citation

Najmi A, Rey D, Rashidi TH. Transp. Res. E Logist. Transp. Rev. 2017; 108: 122-140.

Copyright

(Copyright © 2017, Elsevier Publishing)

DOI

10.1016/j.tre.2017.10.009

PMID

unavailable

Abstract

This paper proposes new objective functions for the matching problem arising in ride-sharing systems based on trips' spatial attributes. Novel dynamic matching policies are then proposed to solve the problem dynamically in a rolling horizon framework. Finally, we present a new clustering heuristic to tackle instances with a large number of participants efficiently. We find that the proposed models maximize the matching rate while maintaining distance-savings at an acceptable level, which is an appealing achievement for ride-sharing systems. Further, our solution method is capable of solving large-scale instances in real-time.

Language: en

Keywords

Clustering; Dynamic; Matching policy; Ride-sharing; Rolling horizon