Please use this identifier to cite or link to this item:
|Title:||Taxi dispatch system based on current demands and real-time traffic conditions|
|Authors:||Lee, D.-H. |
|Citation:||Lee, D.-H.,Wang, H.,Cheu, R.L.,Teo, S.H. (2004). Taxi dispatch system based on current demands and real-time traffic conditions. Transportation Research Record (1882) : 193-200. ScholarBank@NUS Repository.|
|Abstract:||The existing taxi dispatch system that taxi operators in Singapore use to handle current bookings was studied. This dispatch system adopts the Global Positioning System and is based on the nearest-coordinate method: the taxi assigned for each booking is the one with the shortest, direct, straight-line distance to the customer location. However, the taxi assigned under this system often is not capable of reaching the customer in the shortest time possible. An alternative dispatch system is proposed, whereby the dispatch of taxis is determined by real-time traffic conditions. In the proposed system, the taxi assigned the booking job is the one with the shortest time path, reaching the customer in the shortest time. This dispatch ensures that customers are served within the shortest period of tune and increases customer satisfaction. The effectiveness of both the existing and the proposed dispatch systems is investigated through computer simulations. The results from a simulation model of the Singapore central business district network are presented and analyzed. Data from the simulations show that the proposed dispatch system is capable of being more efficient in dispatching taxis more quickly and leads to more than 50% reductions in passenger pickup times and average travel distances. A more efficient dispatch system would result in higher standards of customer service and a more organized taxi fleet to meet customer demands better.|
|Source Title:||Transportation Research Record|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 24, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.