Please use this identifier to cite or link to this item:
Title: Performance of multiagent taxi dispatch on extended-runtime taxi availability: A simulation study
Authors: Seow, K.T.
Lee, D.-H. 
Keywords: Automated software agents
Intelligent paratransit transportation
Taxi dispatch
Issue Date: Mar-2010
Citation: Seow, K.T., Lee, D.-H. (2010-03). Performance of multiagent taxi dispatch on extended-runtime taxi availability: A simulation study. IEEE Transactions on Intelligent Transportation Systems 11 (1) : 231-236. ScholarBank@NUS Repository.
Abstract: An empirical and comparative evaluation of multiagent taxi dispatch with extended (E) runtime taxi availability is presented. A taxi in operation is said to be E-runtime available if it has a passenger alighting in δ x<0 minutes' time or is empty, but has no new committed taxi request to service next. In a multiagent architecture, we consider a new operation policy wherein agents of E-runtime available taxis are allowed to negotiate in individual groups of size N for new taxi requests. The main objective is to present an evaluation of the multiagent system performance gains provided by different times-to-arrival of δx, under a discrete range of demand rates for several N-group sizes, as compared with the base case when δx = 0. It is shown that the proposed policy can effectively reduce customer waiting time and empty taxi cruising time by up to about 60% and 96%, respectively, when the service demand is high for a 1000-strong taxi fleet. It is observed that the value selection for the policy parameter δx is an important aspect for improving the general performance of multiagent taxi dispatch. © 2010 IEEE.
Source Title: IEEE Transactions on Intelligent Transportation Systems
ISSN: 15249050
DOI: 10.1109/TITS.2009.2033128
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Jan 27, 2023


checked on Jan 18, 2023

Page view(s)

checked on Jan 26, 2023

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.