Adaptive Routing of Cruising Taxis by Mutual Exchange of Pathways

Authors:
Kosuke Yamamoto;Kentaro Uesugi;Toyohide Watanabe
Affiliations:
Department of Systems and Social Informatics Graduate School of Information Science, Nagoya University, Nagoya, Japan 464-8603;Department of Systems and Social Informatics Graduate School of Information Science, Nagoya University, Nagoya, Japan 464-8603;Department of Systems and Social Informatics Graduate School of Information Science, Nagoya University, Nagoya, Japan 464-8603
Venue:
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II
Year:
2008

Citing 1
Cited 6

A Note on Dijkstra's Shortest Path Algorithm

Journal of the ACM (JACM)

Probabilistic Estimation of Travel Behaviors Using Zone Characteristics

KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part II
Modeling and estimation of travel behaviors using bayesian network

Intelligent Decision Technologies - Special issue on design of intelligent environment
Where to find my next passenger

Proceedings of the 13th international conference on Ubiquitous computing
Towards reducing taxicab cruising time using spatio-temporal profitability maps

SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
A Multi-Agent Taxi Dispatching System

International Journal of Agent Technologies and Systems
From taxi GPS traces to social and community dynamics: A survey

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The tremendous development of information and communication technology had large influence for service management in the taxi dispatching work. However, taxi drivers who want to drive in "cruising taxis" decide their travel routes by depending on their own heuristics. As a result, traffic jams and local excess supplies have often been occurred. In this paper, we propose an adaptive routing method in the cruising taxis. In our method, pathways where many customers are expected to exist are assigned to drivers. This assignment changes dynamically adapting to changes of taxis' positions. Our simulation experiment shows that our method was able to gain more customers than the existing means of cruising taxis.