Abstract
This paper presents a recommendation mechanism for taxi-sharing. The first aim of our model is to respectively recommend taxis and passengers for picking up passengers quickly and finding taxis easily. The second purpose is providing taxi-sharing service for passengers who want to save the payment. In our method, we analyze the historical global positioning system trajectories generated by 10,357 taxis during 110 days and present the service region with time-dependent R-Tree. We formulate the problem of choosing the paths among the taxis in the same region by using non-cooperative game theory, and find out the solution of this game which is known as Nash equilibrium. The simulation of SUMO, MOVE, and TraCI are adopted to fit our model to verify the proposed recommendation mechanism. The results show that our method can find taxis and passengers efficiently. In addition, applying our method can reduce the payment of passengers and increase the taxi revenue by taxi-sharing.
| Original language | English |
|---|---|
| Pages (from-to) | 761-786 |
| Number of pages | 26 |
| Journal | Wireless Personal Communications |
| Volume | 88 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 2016 Jun 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Electrical and Electronic Engineering
Cite this
}
Using Non-cooperative Game Theory for Taxi-Sharing Recommendation Systems. / Li, Jian Pan; Horng, Gwo Jiun; Chen, Yin Jun; Cheng, Sheng Tzong.
In: Wireless Personal Communications, Vol. 88, No. 4, 01.06.2016, p. 761-786.Research output: Contribution to journal › Article
TY - JOUR
T1 - Using Non-cooperative Game Theory for Taxi-Sharing Recommendation Systems
AU - Li, Jian Pan
AU - Horng, Gwo Jiun
AU - Chen, Yin Jun
AU - Cheng, Sheng Tzong
PY - 2016/6/1
Y1 - 2016/6/1
N2 - This paper presents a recommendation mechanism for taxi-sharing. The first aim of our model is to respectively recommend taxis and passengers for picking up passengers quickly and finding taxis easily. The second purpose is providing taxi-sharing service for passengers who want to save the payment. In our method, we analyze the historical global positioning system trajectories generated by 10,357 taxis during 110 days and present the service region with time-dependent R-Tree. We formulate the problem of choosing the paths among the taxis in the same region by using non-cooperative game theory, and find out the solution of this game which is known as Nash equilibrium. The simulation of SUMO, MOVE, and TraCI are adopted to fit our model to verify the proposed recommendation mechanism. The results show that our method can find taxis and passengers efficiently. In addition, applying our method can reduce the payment of passengers and increase the taxi revenue by taxi-sharing.
AB - This paper presents a recommendation mechanism for taxi-sharing. The first aim of our model is to respectively recommend taxis and passengers for picking up passengers quickly and finding taxis easily. The second purpose is providing taxi-sharing service for passengers who want to save the payment. In our method, we analyze the historical global positioning system trajectories generated by 10,357 taxis during 110 days and present the service region with time-dependent R-Tree. We formulate the problem of choosing the paths among the taxis in the same region by using non-cooperative game theory, and find out the solution of this game which is known as Nash equilibrium. The simulation of SUMO, MOVE, and TraCI are adopted to fit our model to verify the proposed recommendation mechanism. The results show that our method can find taxis and passengers efficiently. In addition, applying our method can reduce the payment of passengers and increase the taxi revenue by taxi-sharing.
UR - http://www.scopus.com/inward/record.url?scp=84958258980&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84958258980&partnerID=8YFLogxK
U2 - 10.1007/s11277-016-3202-3
DO - 10.1007/s11277-016-3202-3
M3 - Article
AN - SCOPUS:84958258980
VL - 88
SP - 761
EP - 786
JO - Wireless Personal Communications
JF - Wireless Personal Communications
SN - 0929-6212
IS - 4
ER -