A novel approach to independent taxi scheduling problem based on stable matching
This 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 ar...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Published: |
Palgrave Macmillan
2014
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/49415/ |
| _version_ | 1848801183743868928 |
|---|---|
| author | Bai, Ruibin Li, Jiawei Atkin, Jason A.D. Kendall, Graham |
| author_facet | Bai, Ruibin Li, Jiawei Atkin, Jason A.D. Kendall, Graham |
| author_sort | Bai, Ruibin |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | This 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. |
| first_indexed | 2025-11-14T20:12:40Z |
| format | Article |
| id | nottingham-49415 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T21:03:25Z |
| publishDate | 2014 |
| publisher | Palgrave Macmillan |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-494152025-09-09T14:45:27Z https://eprints.nottingham.ac.uk/49415/ A novel approach to independent taxi scheduling problem based on stable matching Bai, Ruibin Li, Jiawei Atkin, Jason A.D. Kendall, Graham This 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. Palgrave Macmillan 2014-10-31 Article PeerReviewed 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 taxi scheduling; game theory; stable marriage problem; GPS; street hailing https://link.springer.com/article/10.1057%2Fjors.2013.96 doi:10.1057/jors.2013.96 doi:10.1057/jors.2013.96 |
| spellingShingle | taxi scheduling; game theory; stable marriage problem; GPS; street hailing Bai, Ruibin Li, Jiawei Atkin, Jason A.D. Kendall, Graham A novel approach to independent taxi scheduling problem based on stable matching |
| title | A novel approach to independent taxi scheduling problem based on stable matching |
| title_full | A novel approach to independent taxi scheduling problem based on stable matching |
| title_fullStr | A novel approach to independent taxi scheduling problem based on stable matching |
| title_full_unstemmed | A novel approach to independent taxi scheduling problem based on stable matching |
| title_short | A novel approach to independent taxi scheduling problem based on stable matching |
| title_sort | novel approach to independent taxi scheduling problem based on stable matching |
| topic | taxi scheduling; game theory; stable marriage problem; GPS; street hailing |
| url | https://eprints.nottingham.ac.uk/49415/ https://eprints.nottingham.ac.uk/49415/ https://eprints.nottingham.ac.uk/49415/ |