A Multi-Agent Taxi Dispatching System

A Multi-Agent Taxi Dispatching System

Mahdi Hasheminezhad, Ardeshir Bahreininejad
Copyright: © 2010 |Pages: 10
DOI: 10.4018/jats.2010040101
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

The taxi assignment problem may be categorized as a vehicle routing problem. ?When placed in the field of resource allocation, it is a dynamic problem in which ?the situation changes as the work progresses. This paper presents a new agent-based approach to tackle the taxi assignment problem. New parameters are ?introduced to increase the satisfaction of the drivers. The authors propose a new algorithm to improve the parameters. Simulations were also conducted to examine the efficiency of the proposed method. The results indicate the effectiveness of the proposed taxi assignment/dispatching approach.
Article Preview
Top

Problem Definition

The problem under study in this paper is a situation where taxis are scattered in the city and a dispatch center receives customers' requests and assigns them to taxis. In this problem, we assume that customers are ready for pickup as soon as they call and we also assume that each customer needs exactly one taxi and has exactly one destination. Also, we assume that taxis always accept the mission according to dispatch center's command.

Current Situation

The classic method for this problem divides the city to some regions and makes a queue from taxis in each region (Silva, 2003). When a new request is received, the dispatch center selects the first taxi from the queue of the region. If there is no taxi available in the caller's region, the center chooses a taxi from top of the queue of one of the neighboring regions. When a taxi fulfills a request, it notifies the center and the taxi is put at the end of the queue of its current region.

Global Positioning Systems (GPS) can provide a modern means for location discovery. Using GPS, the dispatch center may pinpoint the exact location of each taxi at all times. In this method the center does not require to use the queue anymore and when a new request is received, it chooses the nearest taxi to the customer (Lee et al., 2004).

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 9: 1 Issue (2017)
Volume 8: 1 Issue (2016)
Volume 7: 3 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing