A novel approach to independent taxi scheduling problem based on stable matching
Bai, Ruibin; Li, Jiawei; Atkin, Jason A.D.; Kendall, Graham
Jason A.D. Atkin
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.
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|
|Publisher||Taylor & Francis Open|
|Peer Reviewed||Peer Reviewed|
|Keywords||taxi scheduling; game theory; stable marriage problem; GPS; street hailing|
|Copyright Statement||Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf|
|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|
A novel approach to independent taxi scheduling problem based on stable matching.pdf
Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf
You might also like
Do film festivals attract tourists?
Is Evolutionary Computation evolving fast enough?