2020
DOI: 10.1016/j.trc.2019.05.036
|View full text |Cite
|
Sign up to set email alerts
|

Modeling urban taxi services with e-hailings: A queueing network approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 21 publications
(9 citation statements)
references
References 29 publications
0
9
0
Order By: Relevance
“…Uncertainty will be the main barrier against using taxis as a transport mode [45]. Zhang et al established a queuingbased SM/M/1 modeling structure to estimate passenger-vehicle matching time in the new taxi system [47]. Zhang et al proposed that taxi-coming probability was an important taxi availability index influencing the customers' satisfaction, in which the probability of taxicoming was assumed to satisfy the Poisson distribution [46].…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…Uncertainty will be the main barrier against using taxis as a transport mode [45]. Zhang et al established a queuingbased SM/M/1 modeling structure to estimate passenger-vehicle matching time in the new taxi system [47]. Zhang et al proposed that taxi-coming probability was an important taxi availability index influencing the customers' satisfaction, in which the probability of taxicoming was assumed to satisfy the Poisson distribution [46].…”
Section: Literature Reviewmentioning
confidence: 99%
“…Also, taxi drivers' aimless driving path and passengers' arrival randomness will result in an uncertain passenger waiting time [46]. Two assumptions are defined to calculate expected passenger waiting time: (1) The passenger and vacant taxi arrival processes are Poisson processes and that the service times are exponentially distributed [47]; (2) passengers and vehicles are matched on a first-come-first-served (FCFS) basis in the taxi system [47]. Thereby, this paper utilizes the simple M/M/1 queue, which belongs to queuing theoretic approaches, to estimate expected passenger waiting time (wt i ) in each spatial unit i in different time intervals of the day.…”
Section: Dynamic Taxi-based Potential Accessibility Measurementioning
confidence: 99%
“…e design and algorithms of matching and scheduling models act as bottlenecks in related research. Zhang, W. et al proposed the spatial wide equilibrium model to solve the empty car matching problem [10]. Mark et al proposed a model on real-time dispatching for a fleet of demand-responsive passenger vehicles such as taxis or variably routed buses [11].…”
Section: Introductionmentioning
confidence: 99%
“…To address these problems, different work schemes and their regulation have been adopted with varying degrees of success, implementing the MTBAs to provide better quality services to passengers and entirely in tune with market changes (Hamzah et al, 2018;Weng et al, 2017) being proposed for their applicability in taxis in many countries (Ge et al, 2020;Nguyen-Phuoc et al, 2020;Wang et al, 2016;Ye et al, 2018;Zhang, Honnappa & Ukkusuri, 2020).…”
Section: Introductionmentioning
confidence: 99%