Abstract

Taxi services play a critical role in the public transportation system in our cities. However, we usually find it difficult to catch vacant taxis based on our experience alone in the random taxi-waiting mode, especially on the streets unfamiliar to us, which may greatly influence users’ taxi service experience. Therefore, how to recommend appropriate waiting locations for passengers becomes meaningful, and the available large-scale taxi trajectory data have helped with the right recommendation. Recent researches have focused on the one-location recommendation for the passengers without considering the recommendation failure situation where they find no vacant taxis available after waiting a long time. In response to this deficiency, we designed a Crossroad Network-based Markov Decision Process (CN-MDP) scheme to recommend a waiting location sequence for a current passenger whose cumulative probability of catching a vacant taxi getting close to 100%. Further, our scheme changes the recommended locations from the road segments to the crossroads, as we discovered that passengers are more likely to catch vacant taxis at the crossroads connected to multi-road segments. In addition, the multi-passengers competing strategy for vacant taxis at the same location and in the same time slot is also involved in our scheme by dynamically updating the pass rate of vacant taxis at each crossroad and road segment. Some evaluations on a real taxi data set from a major city in China have shown that our recommendation scheme works well and has a higher probability of catching vacant taxis than that of our previous approach and other ones. Our scheme further improves the user experience of taxi services.

Highlights

  • Taxi services, with the ubiquitous availability, route flexibility and comfortable travel experience, make a critical contribution to the public transportation system in our cities [1], [2]

  • PROPOSED SCHEME In our previous work [6], we proposed a Markov Decision Process approach to address the limitations of related work

  • Based on our previous scheme, we further find that one passenger waiting for taxis at a crossroad will have higher probability of catching vacant taxis, because one crossroad is usually connected to multi-road segments, where more vacant taxis pass by

Read more

Summary

INTRODUCTION

With the ubiquitous availability, route flexibility and comfortable travel experience, make a critical contribution to the public transportation system in our cities [1], [2]. PROPOSED SCHEME In our previous work [6], we proposed a Markov Decision Process approach to address the limitations of related work In this strategy, we recommended a sequence of road segments to passengers for catching vacant taxis. We propose a recommendation approach based on Markov Decision Process (MDP) model to select the crossroad sequence with the highest total pass rate for the current waiting passenger. D. OUR CONTRIBUTIONS In this paper, we substantially improve the approach in our previous work by generalizing the MDP approach to crossroad networks, extending our scheme to a multi-passengers competitive situation at the same location within the same time slot, and conducting extensive experiments and simulations using real data. We propose a Crossroad Network-based MDP (CN-MDP) model to predict the location sequence for catching vacant taxis, and present a multi-passengers competition solution by dynamically updating the pass rate of vacant taxis.

DATA AND MODEL SETTINGS
THRESHOLD PARAMETERS SETTING
SOLVING THE TWO VALUE FUNCTIONS
EVALUATION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call