Please use this identifier to cite or link to this item:
|Title:||A collaborative multiagent taxi-dispatch system|
|Keywords:||Automated software agents|
intelligent paratransit transportation
|Citation:||Seow, K.T., Dang, N.H., Lee, D.-H. (2010-07). A collaborative multiagent taxi-dispatch system. IEEE Transactions on Automation Science and Engineering 7 (3) : 607-616. ScholarBank@NUS Repository. https://doi.org/10.1109/TASE.2009.2028577|
|Abstract:||This paper presents a novel multiagent approach to automating taxi dispatch that services current bookings in a distributed fashion. The existing system in use by a taxi operator in Singapore and elsewhere, attempts to increase customer satisfaction locally, by sequentially dispatching nearby taxis to service customers. The proposed dispatch system attempts to increase customer satisfaction more globally, by concurrently dispatching multiple taxis to the same number of customers in the same geographical region, and vis - vis human driver satisfaction. To realize the system, a multiagent architecture is proposed, populated with software collaborative agents that can actively negotiate on behalf of taxi drivers in groups of size N for available customer bookings. Theoretically, an analysis of the boundary and optimal multiagent taxi-dispatch situations is presented along with a discussion of their implications. Experimentally, the operational efficiency of the existing and proposed dispatch systems was evaluated through computer simulations. The empirical results, obtained for a 1000-strong taxi fleet over a discrete range of N, show that the proposed system can dispatch taxis with reduction in customer waiting and empty taxi cruising times of up to 33.1% and 26.3%, respectively; and up to 41.8% and 41.2% reduction when a simple negotiation speedup heuristic was applied. © 2010 IEEE.|
|Source Title:||IEEE Transactions on Automation Science and Engineering|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 23, 2019
WEB OF SCIENCETM
checked on Feb 6, 2019
checked on Dec 22, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.