Please use this identifier to cite or link to this item:
|Title:||Towards an automated multiagent taxi-dispatch system|
|Citation:||Seow, K.T.,Dang, N.H.,Lee, D.-H. (2007). Towards an automated multiagent taxi-dispatch system. Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007 : 1045-1050. ScholarBank@NUS Repository. https://doi.org/10.1109/COASE.2007.4341673|
|Abstract:||This paper presents the study of a novel approach towards an automated taxi dispatch system that handles current bookings in a distributed fashion. Existing systems in use by taxi operators in Singapore attempt 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, we propose a multiagent architecture, populated with software collaborative agents that can actively negotiate on behalf of taxi drivers in groups of size N for available customer bookings. The operational efficiency of the existing and proposed dispatch systems was evaluated through computer simulations on MITSIMLab, an existing simulation-based laboratory originally developed for evaluating traffic management system designs at the operational level. 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 up to 33.1% and 26.3% reduction in customer waiting time and empty taxi cruising time, respectively. © 2007 IEEE.|
|Source Title:||Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 9, 2018
checked on Dec 8, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.