Open AccessThe optimal dispatching of taxis under congestion: A rolling horizon approach
Author(s) -
Wong K. I.,
Bell Michael G. H.
Publication year - 2006
Publication title -
journal of advanced transportation
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.577
H-Index - 46
eISSN - 2042-3195
pISSN - 0197-6729
DOI - 10.1002/atr.5670400207
Subject(s) - taxis , computer science , heuristics , predictability , anticipation (artificial intelligence) , traffic congestion , transport engineering , operations research , time horizon , truck , rush hour , public transport , engineering , mathematical optimization , automotive engineering , mathematics , artificial intelligence , statistics , operating system
Taxis make an important contribution to transport in many parts of the world, offering demand‐responsive, door‐to‐door transport. In larger cities, taxis may be hailed on‐street or taken from taxi ranks. Elsewhere, taxis are usually ordered by phone. The objective of a taxi dispatcher is to maximize the efficiency of fleet utilization. While the spatial and temporal distribution of taxi requests has in general a high degree of predictability, real time traffic congestion information can be collected and disseminated to taxis by communication technologies. The efficiency of taxi dispatching may be significantly improved through the anticipation of future requests and traffic conditions. A rolling horizon approach to the optimisation of taxi dispatching is formulated, which takes the stochastic and dynamic nature of the problem into account. Numerical experiments are presented to illustrate the performances of the heuristics, taking the time dependency of travel times and passenger arrivals into account.