Connecting e-hailing to mass transit platform: Analysis of relative spatial position

Abstract This paper analyzes and compares two different relative spatial position (RSP) designs in an integrated e-hailing/fixed-route transit system: a zone-based design that operates e-hailing vehicles within a zone, and a line-based design that operates e-hailing vehicles along a fixed-route transit line and with a stable headway. To conduct a meaningful comparison, the optimal design problems for both systems are formulated using a same analytical framework based on the continuous approximation approach. A comprehensive numerical experiment is performed to compare various cost components corresponding to the optimal designs, and a discrete-event simulation model is developed to validate the analysis. The analytical and simulation results agree with each other well, with a discrepancy in the total system cost less than 5% in most test scenarios. These results also suggest that the line-based system consistently outperforms the zone-based system in terms of both agency and user costs, for all scenarios tested. Compared to the zone-based design, the line-based design features a sparser fixed-route network (resulting in larger stop spacing) but a higher dispatching frequency. It is concluded that the higher efficiency of the line-based design is likely derived from the strategy of operating e-hailing vehicles with a more regular route/headway structure and allowing ride-sharing.

[1]  Carlos F Daganzo,et al.  Public Transportation Systems , 2019 .

[2]  Barbara Potter ANN ARBOR'S DISPATCHING SYSTEM , 1976 .

[3]  Hokey Min,et al.  A dial-a-ride problem for client transportation in a health-care organization , 2007, Comput. Oper. Res..

[4]  Y. Nie,et al.  A Demand Adaptive Paired-Line Hybrid Transit System , 2017 .

[5]  Zuo-Jun Max Shen,et al.  Modeling taxi services with smartphone-based e-hailing applications , 2015 .

[6]  Gilbert Laporte,et al.  The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms , 2003, 4OR.

[7]  Harilaos N. Psaraftis,et al.  A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem , 1980 .

[8]  Lyle G. Wermers Urban Mass Transportation Planning , 1970 .

[9]  Hai Yang,et al.  Economic Analysis of Ride-sourcing Markets , 2016 .

[10]  David M. Stein,et al.  Scheduling Dial-a-Ride Transportation Systems , 1978 .

[11]  Jean-François Cordeau,et al.  Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows , 2009, Transp. Sci..

[12]  Randolph W. Hall,et al.  Performance and Design of Mobility Allowance Shuttle Transit Services: Bounds on the Maximum Longitudinal Velocity , 2006, Transp. Sci..

[13]  Federico Malucelli,et al.  Demand Adaptive Systems: Some Proposals on Flexible Transit1 , 1999 .

[14]  Antonio Pratelli,et al.  A mathematical programming model for the bus deviation route problem , 2001, J. Oper. Res. Soc..

[15]  Carlos F. Daganzo,et al.  An approximate analytic model of many-to-many demand responsive transportation systems , 1978 .

[16]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem , 2002 .

[17]  Jean-François Cordeau,et al.  A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..

[18]  Baha Waheed Yousef Alshalalfah,et al.  Planning, Design and Scheduling of Flex-route Transit Service , 2010 .

[19]  Randolph W. Hall,et al.  NETWORK DESIGN FOR A GRID HYBRID TRANSIT SERVICE , 2004 .

[20]  R. Jayakrishnan,et al.  Design and Operational Concepts of High-Coverage Point-to-Point Transit System , 2001 .

[21]  Hai Yang,et al.  Pricing strategies for a taxi-hailing platform , 2016 .

[22]  Luca Quadrifoglio,et al.  Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints , 2008, Eur. J. Oper. Res..

[23]  Luca Quadrifoglio,et al.  An insertion heuristic for scheduling Mobility Allowance Shuttle Transit (MAST) services , 2007, J. Sched..

[24]  References , 1971 .

[25]  Teodor Gabriel Crainic,et al.  Flexible many-to-few + few-to-many = an almost personalized transit system , 2001 .

[26]  John R. Hauser,et al.  ADVANCED DIAL-A-RIDE ALGORITHMS RESEARCH PROJECT , 1976 .

[27]  Carlos F. Daganzo,et al.  Structure of Competitive Transit Networks , 2009 .