A real-time algorithm to solve the peer-to-peer ride-matching problem in a flexible ridesharing system

被引：119

作者：

Masoud, Neda ^{[1
]}

Jayakrishnan, R. ^{[2
]}

机构：

[1] Univ Michigan, Dept Civil & Environm Engn, Ann Arbor, MI 48109 USA

[2] Univ Calif Irvine, Dept Civil & Environm Engn, Irvine, CA 92697 USA

来源：

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL | 2017年 / 106卷

关键词：

On-demand transportation; Ridesharing; Ride-matching; Multi-modal transportation; CAR POOLING PROBLEM; SERVICES; WINDOWS;

D O I：

10.1016/j.trb.2017.10.006

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

Real-time peer-to-peer ridesharing is a promising mode of transportation that has gained popularity during the recent years thanks to the wide-spread use of smart phones, mobile application development platforms, and online payment systems. An assignment of drivers to riders, known as the ride-matching problem, is a central component of a peer to-peer ridesharing system. In this paper we discuss the features of a flexible ridesharing system and propose an algorithm to optimally solve the ride-matching problem in a flexible ridesharing system in real-time. We generate random instances of the problem, and perform sensitivity analysis over some of the important parameters in a ridesharing system. Furthermore, we discuss two novel approaches to increase the performance of a ridesharing system. (C) 2017 Elsevier Ltd. All rights reserved.

引用

页码：218 / 236

页数：19

共 34 条

[1]

Agatz N., 2009, ERIM REPORT SERIES R

[2] Dynamic ride-sharing: A simulation study in metro Atlanta [J].

Agatz, Niels A. H. ;

Erera, Alan L. ;

Savelsbergh, Martin W. P. ;

Wang, Xing .

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2011, 45 (09) :1450-1464

[3]

[Anonymous], 2005, J. Exp. Algor., DOI [10.1145/1064546.1103378, DOI 10.1145/1064546.1103378]

[4] An exact method for the car pooling problem based on Lagrangean column generation [J].

Baldacci, R ;

Maniezzo, V ;

Mingozzi, A .

OPERATIONS RESEARCH, 2004, 52 (03) :422-439

[5]

Bockmann M., 2013, The shared economy: It is time to start caring about sharing

[6]

value creating factors in the shared economy

[7] Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots [J].

Braekers, Kris ;

Caris, An ;

Janssens, Gerrit K. .

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2014, 67 :166-186

[8]

Business Insider, 2015, JUST REL ITS 1 REP I

[9] A distributed geographic information system for the daily car pooling problem [J].

Calvo, RW ;

de Luigi, F ;

Haastrup, P ;

Maniezzo, V .

COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (13) :2263-2278

[10] Designing a multimodal generalised ride sharing system [J].

Cangialosi, Edoardo ;

Di Febbraro, Angela ;

Sacco, Nicola .

IET INTELLIGENT TRANSPORT SYSTEMS, 2016, 10 (04) :227-236

← 1 2 3 4 →