Online Cost-Sharing Mechanism Design for Demand-Responsive Transport Systems

被引:31
作者
Furuhata, Masabumi [1 ]
Daniel, Kenny [1 ]
Koenig, Sven [2 ]
Ordonez, Fernando [1 ,3 ]
Dessouky, Maged [4 ]
Brunet, Marc-Etienne [1 ]
Cohen, Liron [2 ]
Wang, Xiaoqing [4 ]
机构
[1] Univ So Calif, Los Angeles, CA 90089 USA
[2] Univ So Calif, Dept Comp Sci, Los Angeles, CA 90089 USA
[3] Univ Chile, Dept Ind Engn, Santiago 8370439, Chile
[4] Univ So Calif, Dept Ind & Syst Engn, Los Angeles, CA 90089 USA
关键词
Cost sharing; demand-responsive transport (DRT) systems; online mechanism design; A-RIDE PROBLEM; ALLOCATION; PICKUP;
D O I
10.1109/TITS.2014.2336212
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
Demand-responsive transport (DRT) systems provide flexible transport services for passengers who request door-to-door rides in shared-ride mode without fixed routes and schedules. DRT systems face interesting coordination challenges. For example, one has to design cost-sharing mechanisms for offering fare quotes to potential passengers so that all passengers are treated fairly. The main issue is how the operating costs of the DRT system should be shared among the passengers (given that different passengers cause different amounts of inconvenience to the other passengers), taking into account that DRT systems should provide fare quotes instantaneously without knowing future ride request submissions. We determine properties of cost-sharing mechanisms that make DRT systems attractive to both the transport providers and passengers, namely online fairness, immediate response, individual rationality, budget balance, and ex-post incentive compatibility. We propose a novel cost-sharing mechanism, which is called Proportional Online Cost Sharing (POCS), which provides passengers with upper bounds on their fares immediately after their ride request submissions despite missing knowledge of future ride request submissions, allowing them to accept their fare quotes or drop out. We examine how POCS satisfies these properties in theory and computational experiments.
引用
收藏
页码:692 / 707
页数:16
相关论文
共 34 条
[1]   COST ALLOCATION IN TRANSPORTATION SYSTEMS [J].
ANDERSON, RC ;
CLAUS, A .
SOUTHERN ECONOMIC JOURNAL, 1976, 43 (01) :793-803
[2]   Dynamic pickup and delivery problems [J].
Berbeglia, Gerardo ;
Cordeau, Jean-Francois ;
Laporte, Gilbert .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 202 (01) :8-15
[3]  
Brenner J, 2010, LECT NOTES COMPUT SC, V6078, P252, DOI 10.1007/978-3-642-13073-1_23
[4]  
Cervero R., 1997, Paratransit in America: Redefining Mass Transportation
[5]   The dial-a-ride problem: models and algorithms [J].
Cordeau, Jean-Francois ;
Laporte, Gilbert .
ANNALS OF OPERATIONS RESEARCH, 2007, 153 (01) :29-46
[6]  
d'Orey PM, 2012, IEEE INT C INTELL TR, P140, DOI 10.1109/ITSC.2012.6338703
[7]   A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows [J].
Diana, M ;
Dessouky, MM .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2004, 38 (06) :539-557
[8]  
Ellis E., 2009, Guidebook for Rural Demand-Response Transportation (No. 136)
[9]   Cost allocation in collaborative forest transportation [J].
Frisk, M. ;
Gothe-Lundgren, M. ;
Jornsten, K. ;
Ronnqvist, M. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 205 (02) :448-458
[10]   Ridesharing: The state-of-the-art and future directions [J].
Furuhata, Masabumi ;
Dessouky, Maged ;
Ordonez, Fernando ;
Brunet, Marc-Etienne ;
Wang, Xiaoqing ;
Koenig, Sven .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2013, 57 :28-46