Please use this identifier to cite or link to this item:
|Title:||Limited information-sharing strategy for taxi-customer searching problem in nonbooking taxi service|
|Authors:||Lee, D.-H. |
|Source:||Lee, D.-H., Wu, X., Sun, L. (2013-01-12). Limited information-sharing strategy for taxi-customer searching problem in nonbooking taxi service. Transportation Research Record (2333) : 46-54. ScholarBank@NUS Repository. https://doi.org/10.3141/2333-06|
|Abstract:||One of the issues in current taxi service is the imbalance between supply and demand. In response to this issue, an automatic taxi-dispatching approach in which customers can book taxis through phones or mobile devices is widely used in many large cities worldwide. However, this approach is not satisfactory: most customers still prefer nonbooking taxi service (NBTS), taking the taxi by either waiting at a taxi stand or hailing one on the street. One important reason for this phenomenon is that customers take a lower risk in NBTS: they are free from complicated booking procedures and have no commitment to any as-yet-arrived taxis. To facilitate the taxi-customer matching process in NBTS, a novel control strategy is proposed-namely, the limited information-sharing strategy (LISS) for the taxi-customer searching problem in NBTS, in which both the taxi and the customer are equipped with mobile devices that can communicate with each other within limited searching ranges. The proposed LISS is based on the game theoretical formulation in which a learning algorithm to find the pure Nash equilibrium is developed. A microscopic traffic simulation model for evaluation of the LISS is developed. The simulation results show that the proposed LISS is an effective control strategy when taxi supply is low and will not increase the risk of the taxi driver in losing the total occupied time.|
|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 Dec 7, 2017
WEB OF SCIENCETM
checked on Nov 28, 2017
checked on Dec 11, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.