A reliability-based transit trip planning model under transit network uncertainty

Yang Chen, Shu Yang, Mengqi Hu, Yao-jan Wu

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Transit, although an important public transportation mode, is not thoroughly utilized in the United States. To encourage the public to take transit, agencies have developed systems and tools that assist travelers in accessing and using information. Transit data modeling and trip planner system architecture developments have helped advance these systems, and the recent emergence of transit trip planning algorithms promises further enhancement. Conventional transit trip planning algorithms are usually developed based on graph theory. In order to utilize these algorithms, certain assumptions must be made to support these algorithms (e.g. buses always run on time). However, these assumptions may not be realistic. To overcome these limitations, our study develops an innovative transit trip planning model using chance constrained programming. Unlike previous studies, which only minimized passenger-experienced travel time, our study also considers transit service reliability. Additionally, in-vehicle travel time, transfer time, and walking time are all included as elements of passenger-experienced travel time. Our transit trip planning model avoids the assumptions of previous studies by incorporating transit service reliability and is capable of finding reliable transit paths with minimized passenger-experienced travel time. The algorithm can also suggest a buffer time before departure to ensure on-time arrivals at a given confidence level. General Transit Feed Specification data, collected around Tucson, Arizona, was used to model the transit network using a “node-link” scheme and estimate link-level travel time and travel time reliability. Three groups of experiments were developed to test the performance of the proposed model. The experiment results suggested that the optimal anticipated travel time increased with increasing on-time arrival confidence level and walking was preferred over direct bus transfers that involved out of direction travel. The proposed model can also include additional travel modes and can easily be extended to include intercity trip planning.

Original languageEnglish (US)
Pages (from-to)477-496
Number of pages20
JournalPublic Transport
Volume8
Issue number3
DOIs
StatePublished - Dec 1 2016

Fingerprint

planning model
Travel time
uncertainty
Planning
travel
Time and motion study
Graph theory
time
Uncertainty
planning
Data structures
confidence
Experiments
graph theory
Specifications
public transportation
experiment

Keywords

  • Chance constrained programming
  • General transit feed specification
  • Transit travel time
  • Transit travel time reliability

ASJC Scopus subject areas

  • Information Systems
  • Transportation
  • Mechanical Engineering
  • Management Science and Operations Research

Cite this

A reliability-based transit trip planning model under transit network uncertainty. / Chen, Yang; Yang, Shu; Hu, Mengqi; Wu, Yao-jan.

In: Public Transport, Vol. 8, No. 3, 01.12.2016, p. 477-496.

Research output: Contribution to journalArticle

Chen, Yang ; Yang, Shu ; Hu, Mengqi ; Wu, Yao-jan. / A reliability-based transit trip planning model under transit network uncertainty. In: Public Transport. 2016 ; Vol. 8, No. 3. pp. 477-496.
@article{20e9ab3b9be6419ca601dd2be8ac9b9f,
title = "A reliability-based transit trip planning model under transit network uncertainty",
abstract = "Transit, although an important public transportation mode, is not thoroughly utilized in the United States. To encourage the public to take transit, agencies have developed systems and tools that assist travelers in accessing and using information. Transit data modeling and trip planner system architecture developments have helped advance these systems, and the recent emergence of transit trip planning algorithms promises further enhancement. Conventional transit trip planning algorithms are usually developed based on graph theory. In order to utilize these algorithms, certain assumptions must be made to support these algorithms (e.g. buses always run on time). However, these assumptions may not be realistic. To overcome these limitations, our study develops an innovative transit trip planning model using chance constrained programming. Unlike previous studies, which only minimized passenger-experienced travel time, our study also considers transit service reliability. Additionally, in-vehicle travel time, transfer time, and walking time are all included as elements of passenger-experienced travel time. Our transit trip planning model avoids the assumptions of previous studies by incorporating transit service reliability and is capable of finding reliable transit paths with minimized passenger-experienced travel time. The algorithm can also suggest a buffer time before departure to ensure on-time arrivals at a given confidence level. General Transit Feed Specification data, collected around Tucson, Arizona, was used to model the transit network using a “node-link” scheme and estimate link-level travel time and travel time reliability. Three groups of experiments were developed to test the performance of the proposed model. The experiment results suggested that the optimal anticipated travel time increased with increasing on-time arrival confidence level and walking was preferred over direct bus transfers that involved out of direction travel. The proposed model can also include additional travel modes and can easily be extended to include intercity trip planning.",
keywords = "Chance constrained programming, General transit feed specification, Transit travel time, Transit travel time reliability",
author = "Yang Chen and Shu Yang and Mengqi Hu and Yao-jan Wu",
year = "2016",
month = "12",
day = "1",
doi = "10.1007/s12469-016-0134-y",
language = "English (US)",
volume = "8",
pages = "477--496",
journal = "Public Transport",
issn = "1613-7159",
publisher = "Springer Verlag",
number = "3",

}

TY - JOUR

T1 - A reliability-based transit trip planning model under transit network uncertainty

AU - Chen, Yang

AU - Yang, Shu

AU - Hu, Mengqi

AU - Wu, Yao-jan

PY - 2016/12/1

Y1 - 2016/12/1

N2 - Transit, although an important public transportation mode, is not thoroughly utilized in the United States. To encourage the public to take transit, agencies have developed systems and tools that assist travelers in accessing and using information. Transit data modeling and trip planner system architecture developments have helped advance these systems, and the recent emergence of transit trip planning algorithms promises further enhancement. Conventional transit trip planning algorithms are usually developed based on graph theory. In order to utilize these algorithms, certain assumptions must be made to support these algorithms (e.g. buses always run on time). However, these assumptions may not be realistic. To overcome these limitations, our study develops an innovative transit trip planning model using chance constrained programming. Unlike previous studies, which only minimized passenger-experienced travel time, our study also considers transit service reliability. Additionally, in-vehicle travel time, transfer time, and walking time are all included as elements of passenger-experienced travel time. Our transit trip planning model avoids the assumptions of previous studies by incorporating transit service reliability and is capable of finding reliable transit paths with minimized passenger-experienced travel time. The algorithm can also suggest a buffer time before departure to ensure on-time arrivals at a given confidence level. General Transit Feed Specification data, collected around Tucson, Arizona, was used to model the transit network using a “node-link” scheme and estimate link-level travel time and travel time reliability. Three groups of experiments were developed to test the performance of the proposed model. The experiment results suggested that the optimal anticipated travel time increased with increasing on-time arrival confidence level and walking was preferred over direct bus transfers that involved out of direction travel. The proposed model can also include additional travel modes and can easily be extended to include intercity trip planning.

AB - Transit, although an important public transportation mode, is not thoroughly utilized in the United States. To encourage the public to take transit, agencies have developed systems and tools that assist travelers in accessing and using information. Transit data modeling and trip planner system architecture developments have helped advance these systems, and the recent emergence of transit trip planning algorithms promises further enhancement. Conventional transit trip planning algorithms are usually developed based on graph theory. In order to utilize these algorithms, certain assumptions must be made to support these algorithms (e.g. buses always run on time). However, these assumptions may not be realistic. To overcome these limitations, our study develops an innovative transit trip planning model using chance constrained programming. Unlike previous studies, which only minimized passenger-experienced travel time, our study also considers transit service reliability. Additionally, in-vehicle travel time, transfer time, and walking time are all included as elements of passenger-experienced travel time. Our transit trip planning model avoids the assumptions of previous studies by incorporating transit service reliability and is capable of finding reliable transit paths with minimized passenger-experienced travel time. The algorithm can also suggest a buffer time before departure to ensure on-time arrivals at a given confidence level. General Transit Feed Specification data, collected around Tucson, Arizona, was used to model the transit network using a “node-link” scheme and estimate link-level travel time and travel time reliability. Three groups of experiments were developed to test the performance of the proposed model. The experiment results suggested that the optimal anticipated travel time increased with increasing on-time arrival confidence level and walking was preferred over direct bus transfers that involved out of direction travel. The proposed model can also include additional travel modes and can easily be extended to include intercity trip planning.

KW - Chance constrained programming

KW - General transit feed specification

KW - Transit travel time

KW - Transit travel time reliability

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

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

U2 - 10.1007/s12469-016-0134-y

DO - 10.1007/s12469-016-0134-y

M3 - Article

AN - SCOPUS:85006427760

VL - 8

SP - 477

EP - 496

JO - Public Transport

JF - Public Transport

SN - 1613-7159

IS - 3

ER -