Schedule-based path-finding algorithms for transit trip-planning systems

Ruihong Huang, Zhong Ren Peng

Research output: Contribution to journalArticle

23 Citations (Scopus)

Abstract

Many existing methods for transit assignment and path finding do not support schedule coordination in network search or optimization processes. Other methods do not provide adequate performance that meets the demands for Internet trip-planning applications. Two schedule-based path-finding algorithms (forward search and backward search) are presented for the transit network, in which schedule coordination is an inherent feature. The forward-search algorithm finds the optimal path from an origin to a destination with a planned departure time, and the backward-search algorithm finds the optimal path for an expected arrival time at the destination. In addition, a non-schedule-based minimal-transfer-path algorithm for the transit network is also developed, which is capable of accommodating more path optimization criteria for sophisticated path finding. Facilitated by a uniquely designed network structure based on a geographic information system and an object-oriented data model, these algorithms demonstrated good performance in path finding on a dynamic transit network. These algorithms have been implemented in an Internet transit trip-planning system in the city of Waukesha, Wisconsin.

Original languageEnglish (US)
Pages (from-to)142-148
Number of pages7
JournalTransportation Research Record
Issue number1783
StatePublished - 2002
Externally publishedYes

Fingerprint

Planning
Internet
Geographic information systems
Data structures

ASJC Scopus subject areas

  • Civil and Structural Engineering

Cite this

Schedule-based path-finding algorithms for transit trip-planning systems. / Huang, Ruihong; Peng, Zhong Ren.

In: Transportation Research Record, No. 1783, 2002, p. 142-148.

Research output: Contribution to journalArticle

@article{b652799b45374fdd8319e7cc4c2aa791,
title = "Schedule-based path-finding algorithms for transit trip-planning systems",
abstract = "Many existing methods for transit assignment and path finding do not support schedule coordination in network search or optimization processes. Other methods do not provide adequate performance that meets the demands for Internet trip-planning applications. Two schedule-based path-finding algorithms (forward search and backward search) are presented for the transit network, in which schedule coordination is an inherent feature. The forward-search algorithm finds the optimal path from an origin to a destination with a planned departure time, and the backward-search algorithm finds the optimal path for an expected arrival time at the destination. In addition, a non-schedule-based minimal-transfer-path algorithm for the transit network is also developed, which is capable of accommodating more path optimization criteria for sophisticated path finding. Facilitated by a uniquely designed network structure based on a geographic information system and an object-oriented data model, these algorithms demonstrated good performance in path finding on a dynamic transit network. These algorithms have been implemented in an Internet transit trip-planning system in the city of Waukesha, Wisconsin.",
author = "Ruihong Huang and Peng, {Zhong Ren}",
year = "2002",
language = "English (US)",
pages = "142--148",
journal = "Transportation Research Record",
issn = "0361-1981",
publisher = "US National Research Council",
number = "1783",

}

TY - JOUR

T1 - Schedule-based path-finding algorithms for transit trip-planning systems

AU - Huang, Ruihong

AU - Peng, Zhong Ren

PY - 2002

Y1 - 2002

N2 - Many existing methods for transit assignment and path finding do not support schedule coordination in network search or optimization processes. Other methods do not provide adequate performance that meets the demands for Internet trip-planning applications. Two schedule-based path-finding algorithms (forward search and backward search) are presented for the transit network, in which schedule coordination is an inherent feature. The forward-search algorithm finds the optimal path from an origin to a destination with a planned departure time, and the backward-search algorithm finds the optimal path for an expected arrival time at the destination. In addition, a non-schedule-based minimal-transfer-path algorithm for the transit network is also developed, which is capable of accommodating more path optimization criteria for sophisticated path finding. Facilitated by a uniquely designed network structure based on a geographic information system and an object-oriented data model, these algorithms demonstrated good performance in path finding on a dynamic transit network. These algorithms have been implemented in an Internet transit trip-planning system in the city of Waukesha, Wisconsin.

AB - Many existing methods for transit assignment and path finding do not support schedule coordination in network search or optimization processes. Other methods do not provide adequate performance that meets the demands for Internet trip-planning applications. Two schedule-based path-finding algorithms (forward search and backward search) are presented for the transit network, in which schedule coordination is an inherent feature. The forward-search algorithm finds the optimal path from an origin to a destination with a planned departure time, and the backward-search algorithm finds the optimal path for an expected arrival time at the destination. In addition, a non-schedule-based minimal-transfer-path algorithm for the transit network is also developed, which is capable of accommodating more path optimization criteria for sophisticated path finding. Facilitated by a uniquely designed network structure based on a geographic information system and an object-oriented data model, these algorithms demonstrated good performance in path finding on a dynamic transit network. These algorithms have been implemented in an Internet transit trip-planning system in the city of Waukesha, Wisconsin.

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

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

M3 - Article

AN - SCOPUS:0036955111

SP - 142

EP - 148

JO - Transportation Research Record

JF - Transportation Research Record

SN - 0361-1981

IS - 1783

ER -