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 条

[11] Mathematical Programming Guides Air-Ambulance Routing at Ornge [J].

Carnes, Timothy A. ;

Henderson, Shane G. ;

Shmoys, David B. ;

Ahghari, Mahvareh ;

MacDonald, Russell D. .

INTERFACES, 2013, 43 (03) :232-239

[12] The dial-a-ride problem: models and algorithms [J].

Cordeau, Jean-Francois ;

Laporte, Gilbert .

ANNALS OF OPERATIONS RESEARCH, 2007, 153 (01) :29-46

[13] Design and operational concepts of high-coverage point-to-point transit system [J].

Cortés, CE ;

Jayakrishnan, R .

TRANSPORTATION NETWORK MODELING 2002: PLANNING AND ADMINISTRATION, 2002, (1783) :178-187

[14] Optimization of Dynamic Ridesharing Systems [J].

Di Febbraro, A. ;

Gattorna, E. ;

Sacco, N. .

TRANSPORTATION RESEARCH RECORD, 2013, (2359) :44-50

[15]

Ghoseiri K., 2013, THESIS

[16] A Genetic and Insertion Heuristic Algorithm for Solving the Dynamic Ridematching Problem with Time Windows [J].

Herbawi, Wesam ;

Weber, Michael .

PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2012, :385-392

[17] Ant Colony VS. Genetic Multiobjective Route Planning in Dynamic Multi-hop Ridesharing [J].

Herbawi, Wesam ;

Weber, Michael .

2011 23RD IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2011), 2011, :282-288

[18] A HEURISTIC ALGORITHM FOR THE MULTIVEHICLE ADVANCE REQUEST DIAL-A-RIDE PROBLEM WITH TIME WINDOWS [J].

JAW, JJ ;

ODONI, AR ;

PSARAFTIS, HN ;

WILSON, NHM .

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1986, 20 (03) :243-257

[19] Feeder transit services: Choosing between fixed and demand responsive policy [J].

Li, Xiugang ;

Quadrifoglio, Luca .

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2010, 18 (05) :770-780

[20] A decision support system for the bimodal dial-a-ride problem [J].

Liaw, CF ;

White, CC ;

Bander, J .

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 1996, 26 (05) :552-565

← 1 2 3 4 →