A novel approach to independent taxi scheduling problem based on stable matchingTools Bai, Ruibin, Li, Jiawei, Atkin, Jason A.D. and Kendall, Graham (2014) A novel approach to independent taxi scheduling problem based on stable matching. Journal of the Operational Research Society, 65 (10). pp. 1501-1510. ISSN 1476-9360 Full text not available from this repository.
Official URL: https://link.springer.com/article/10.1057%2Fjors.2013.96
AbstractThis paper describes a taxi scheduling system, which aims to improve the overall efficiency of the system, both from the perspective of the drivers and the customers. This is of particular relevance to Chinese cities, where hailing a taxi on the street is by far the most common way in which taxis are requested, since the majority of taxi drivers operate independently, rather than working for a company. The mobile phone and GPS-based taxi scheduling system, which is described in this paper, aims to provide a decision support system for taxi drivers and facilitates direct information exchange between taxi drivers and passengers, while allowing drivers to remain independent. The taxi scheduling problem is considered to be a non-cooperative game between taxi drivers and a description of this problem is given. We adopt an efficient algorithm to discover a Nash equilibrium, such that each taxi driver and passenger cannot benefit from changing their assigned partner. Two computational examples are given to illustrate the effectiveness of the approach.
Actions (Archive Staff Only)
|
Tools
Tools
