By Topic

Performance of Multiagent Taxi Dispatch on Extended-Runtime Taxi Availability: A Simulation Study

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kiam Tian Seow ; Div. of Comput. Syst., Nanyang Technol. Univ., Singapore, Singapore ; Der-Horng Lee

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 iV-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.

Published in:

Intelligent Transportation Systems, IEEE Transactions on  (Volume:11 ,  Issue: 1 )