A schedule-based pathfinding algorithm for transit networks using pattern first search

Research output: Contribution to journalArticle

22 Citations (Scopus)

Abstract

The lack of effective and efficient schedule-based pathfinding algorithms for transit networks has limited the application of GIS in transit trip planning services. This paper introduces a schedule-based path finding algorithm for transit networks. Based on a pattern-centered spatiotemporal transit network model, the algorithm searches the network by following route patterns. A pattern is a spatial layout of a route in transit terminology. A route usually has many patterns to serve various locations at different times. This path search algorithm is significantly different from traditional shortest path algorithms that are based on adjacent node search. By establishing a set of lemmas and theorems the paper proves that paths generated by the PFS algorithm are schedule-coordinated fastest paths for trips with given constraints. After analyzing computation and database query complexities of the algorithm the paper indicates that the PFS is efficient in computation and database query. Finally, effectiveness and efficiency of the algorithm are demonstrated by implementations in GIS-based online transit trip planners in Wisconsin, US.

Original languageEnglish (US)
Pages (from-to)269-285
Number of pages17
JournalGeoInformatica
Volume11
Issue number2
DOIs
StatePublished - Jun 2007

Fingerprint

Geographic information systems
Geographical Information System
GIS
Terminology
terminology
layout
technical language
Planning
efficiency
planning
lack
time
services

Keywords

  • Algorithm
  • Complexity
  • GIS
  • Pathfinding
  • Transit network
  • Transportation
  • Trip planning

ASJC Scopus subject areas

  • Information Systems
  • Geography, Planning and Development

Cite this

A schedule-based pathfinding algorithm for transit networks using pattern first search. / Huang, Ruihong.

In: GeoInformatica, Vol. 11, No. 2, 06.2007, p. 269-285.

Research output: Contribution to journalArticle

@article{493f622e97244b0d90ec4840a3a4e695,
title = "A schedule-based pathfinding algorithm for transit networks using pattern first search",
abstract = "The lack of effective and efficient schedule-based pathfinding algorithms for transit networks has limited the application of GIS in transit trip planning services. This paper introduces a schedule-based path finding algorithm for transit networks. Based on a pattern-centered spatiotemporal transit network model, the algorithm searches the network by following route patterns. A pattern is a spatial layout of a route in transit terminology. A route usually has many patterns to serve various locations at different times. This path search algorithm is significantly different from traditional shortest path algorithms that are based on adjacent node search. By establishing a set of lemmas and theorems the paper proves that paths generated by the PFS algorithm are schedule-coordinated fastest paths for trips with given constraints. After analyzing computation and database query complexities of the algorithm the paper indicates that the PFS is efficient in computation and database query. Finally, effectiveness and efficiency of the algorithm are demonstrated by implementations in GIS-based online transit trip planners in Wisconsin, US.",
keywords = "Algorithm, Complexity, GIS, Pathfinding, Transit network, Transportation, Trip planning",
author = "Ruihong Huang",
year = "2007",
month = "6",
doi = "10.1007/s10707-006-0011-y",
language = "English (US)",
volume = "11",
pages = "269--285",
journal = "GeoInformatica",
issn = "1384-6175",
publisher = "Kluwer Academic Publishers",
number = "2",

}

TY - JOUR

T1 - A schedule-based pathfinding algorithm for transit networks using pattern first search

AU - Huang, Ruihong

PY - 2007/6

Y1 - 2007/6

N2 - The lack of effective and efficient schedule-based pathfinding algorithms for transit networks has limited the application of GIS in transit trip planning services. This paper introduces a schedule-based path finding algorithm for transit networks. Based on a pattern-centered spatiotemporal transit network model, the algorithm searches the network by following route patterns. A pattern is a spatial layout of a route in transit terminology. A route usually has many patterns to serve various locations at different times. This path search algorithm is significantly different from traditional shortest path algorithms that are based on adjacent node search. By establishing a set of lemmas and theorems the paper proves that paths generated by the PFS algorithm are schedule-coordinated fastest paths for trips with given constraints. After analyzing computation and database query complexities of the algorithm the paper indicates that the PFS is efficient in computation and database query. Finally, effectiveness and efficiency of the algorithm are demonstrated by implementations in GIS-based online transit trip planners in Wisconsin, US.

AB - The lack of effective and efficient schedule-based pathfinding algorithms for transit networks has limited the application of GIS in transit trip planning services. This paper introduces a schedule-based path finding algorithm for transit networks. Based on a pattern-centered spatiotemporal transit network model, the algorithm searches the network by following route patterns. A pattern is a spatial layout of a route in transit terminology. A route usually has many patterns to serve various locations at different times. This path search algorithm is significantly different from traditional shortest path algorithms that are based on adjacent node search. By establishing a set of lemmas and theorems the paper proves that paths generated by the PFS algorithm are schedule-coordinated fastest paths for trips with given constraints. After analyzing computation and database query complexities of the algorithm the paper indicates that the PFS is efficient in computation and database query. Finally, effectiveness and efficiency of the algorithm are demonstrated by implementations in GIS-based online transit trip planners in Wisconsin, US.

KW - Algorithm

KW - Complexity

KW - GIS

KW - Pathfinding

KW - Transit network

KW - Transportation

KW - Trip planning

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

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

U2 - 10.1007/s10707-006-0011-y

DO - 10.1007/s10707-006-0011-y

M3 - Article

VL - 11

SP - 269

EP - 285

JO - GeoInformatica

JF - GeoInformatica

SN - 1384-6175

IS - 2

ER -