Ruibin Bai
A novel approach to independent taxi scheduling problem based on stable matching
Bai, Ruibin; Li, Jiawei; Atkin, Jason A.D.; Kendall, Graham
Authors
Jiawei Li
Jason A.D. Atkin
Graham Kendall
Abstract
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.
Citation
Bai, R., Li, J., Atkin, J. A., & Kendall, G. (2014). A novel approach to independent taxi scheduling problem based on stable matching. Journal of the Operational Research Society, 65(10), https://doi.org/10.1057/jors.2013.96
Journal Article Type | Article |
---|---|
Acceptance Date | Apr 1, 2013 |
Online Publication Date | Sep 4, 2013 |
Publication Date | Oct 31, 2014 |
Deposit Date | Feb 1, 2018 |
Publicly Available Date | Feb 1, 2018 |
Journal | Journal of the Operational Research Society |
Print ISSN | 0160-5682 |
Electronic ISSN | 1476-9360 |
Publisher | Taylor and Francis |
Peer Reviewed | Peer Reviewed |
Volume | 65 |
Issue | 10 |
DOI | https://doi.org/10.1057/jors.2013.96 |
Keywords | taxi scheduling; game theory; stable marriage problem; GPS; street hailing |
Public URL | https://nottingham-repository.worktribe.com/output/737434 |
Publisher URL | https://link.springer.com/article/10.1057%2Fjors.2013.96 |
Additional Information | This is a post-peer-review, pre-copyedit version of an article published in Journal of the Operational Research Society. The definitive publisher-authenticated version: Bai, R., Li, J., Atkin, J. et al. J Oper Res Soc (2014) 65: 1501. doi.10.1057/jors.2013.96 is available online at: https://doi.org/10.1057/jors.2013.96 |
Contract Date | Feb 1, 2018 |
Files
A novel approach to independent taxi scheduling problem based on stable matching.pdf
(1.2 Mb)
PDF
Downloadable Citations
About Repository@Nottingham
Administrator e-mail: discovery-access-systems@nottingham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search