Modeling routing behavior for vacant taxicabs in Urban traffic networks

Xianbiao Hu, Song Gao, Yi-Chang Chiu, Dung Ying Lin

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

Taxicabs account for a significant portion of traffic in many Asian cities, and route choice by taxi drivers is an active research area. The routing objectives of a taxi driver vary, depending on taxi occupancy. If a taxi is occupied by customers, then a least-cost path is usually sought. Several paradigms in the literature are related to such a routing objective. However, the taxi driver's route choice behavior when a taxi is vacant is not well understood. A routing model for vacant taxis is proposed in which taxi drivers are assumed to minimize the expected search time for customers when making routing decisions at intersections. A probabilistic dynamic programming formulation of the problem and the solution algorithm are presented. A numerical analysis was conducted on a hypothetical network resembling the traffic network structure in the city of Taipei, Taiwan. The proposed model exhibited realistic and reasonable properties. This research sheds light on the routing decisions of taxi drivers and therefore directly supports areawide traffic management.

Original languageEnglish (US)
Pages (from-to)81-88
Number of pages8
JournalTransportation Research Record
Issue number2284
DOIs
StatePublished - Jan 12 2012

Fingerprint

Taxicabs
Dynamic programming
Numerical analysis
Costs

ASJC Scopus subject areas

  • Civil and Structural Engineering
  • Mechanical Engineering

Cite this

Modeling routing behavior for vacant taxicabs in Urban traffic networks. / Hu, Xianbiao; Gao, Song; Chiu, Yi-Chang; Lin, Dung Ying.

In: Transportation Research Record, No. 2284, 12.01.2012, p. 81-88.

Research output: Contribution to journalArticle

Hu, Xianbiao ; Gao, Song ; Chiu, Yi-Chang ; Lin, Dung Ying. / Modeling routing behavior for vacant taxicabs in Urban traffic networks. In: Transportation Research Record. 2012 ; No. 2284. pp. 81-88.
@article{d4fa1cd8ba0845f888cc98e33ce326e3,
title = "Modeling routing behavior for vacant taxicabs in Urban traffic networks",
abstract = "Taxicabs account for a significant portion of traffic in many Asian cities, and route choice by taxi drivers is an active research area. The routing objectives of a taxi driver vary, depending on taxi occupancy. If a taxi is occupied by customers, then a least-cost path is usually sought. Several paradigms in the literature are related to such a routing objective. However, the taxi driver's route choice behavior when a taxi is vacant is not well understood. A routing model for vacant taxis is proposed in which taxi drivers are assumed to minimize the expected search time for customers when making routing decisions at intersections. A probabilistic dynamic programming formulation of the problem and the solution algorithm are presented. A numerical analysis was conducted on a hypothetical network resembling the traffic network structure in the city of Taipei, Taiwan. The proposed model exhibited realistic and reasonable properties. This research sheds light on the routing decisions of taxi drivers and therefore directly supports areawide traffic management.",
author = "Xianbiao Hu and Song Gao and Yi-Chang Chiu and Lin, {Dung Ying}",
year = "2012",
month = "1",
day = "12",
doi = "10.3141/2284-10",
language = "English (US)",
pages = "81--88",
journal = "Transportation Research Record",
issn = "0361-1981",
publisher = "US National Research Council",
number = "2284",

}

TY - JOUR

T1 - Modeling routing behavior for vacant taxicabs in Urban traffic networks

AU - Hu, Xianbiao

AU - Gao, Song

AU - Chiu, Yi-Chang

AU - Lin, Dung Ying

PY - 2012/1/12

Y1 - 2012/1/12

N2 - Taxicabs account for a significant portion of traffic in many Asian cities, and route choice by taxi drivers is an active research area. The routing objectives of a taxi driver vary, depending on taxi occupancy. If a taxi is occupied by customers, then a least-cost path is usually sought. Several paradigms in the literature are related to such a routing objective. However, the taxi driver's route choice behavior when a taxi is vacant is not well understood. A routing model for vacant taxis is proposed in which taxi drivers are assumed to minimize the expected search time for customers when making routing decisions at intersections. A probabilistic dynamic programming formulation of the problem and the solution algorithm are presented. A numerical analysis was conducted on a hypothetical network resembling the traffic network structure in the city of Taipei, Taiwan. The proposed model exhibited realistic and reasonable properties. This research sheds light on the routing decisions of taxi drivers and therefore directly supports areawide traffic management.

AB - Taxicabs account for a significant portion of traffic in many Asian cities, and route choice by taxi drivers is an active research area. The routing objectives of a taxi driver vary, depending on taxi occupancy. If a taxi is occupied by customers, then a least-cost path is usually sought. Several paradigms in the literature are related to such a routing objective. However, the taxi driver's route choice behavior when a taxi is vacant is not well understood. A routing model for vacant taxis is proposed in which taxi drivers are assumed to minimize the expected search time for customers when making routing decisions at intersections. A probabilistic dynamic programming formulation of the problem and the solution algorithm are presented. A numerical analysis was conducted on a hypothetical network resembling the traffic network structure in the city of Taipei, Taiwan. The proposed model exhibited realistic and reasonable properties. This research sheds light on the routing decisions of taxi drivers and therefore directly supports areawide traffic management.

UR - http://www.scopus.com/inward/record.url?scp=84867764110&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867764110&partnerID=8YFLogxK

U2 - 10.3141/2284-10

DO - 10.3141/2284-10

M3 - Article

AN - SCOPUS:84867764110

SP - 81

EP - 88

JO - Transportation Research Record

JF - Transportation Research Record

SN - 0361-1981

IS - 2284

ER -