Travel times and transfers in public transport: Comprehensive accessibility analysis based on Pareto-optimal journeys

Tutkimustuotos: Lehtiartikkelivertaisarvioitu

Standard

Harvard

APA

Vancouver

Author

Bibtex - Lataa

@article{3c01499f4c074a3daab256efd2f479fd,
title = "Travel times and transfers in public transport: Comprehensive accessibility analysis based on Pareto-optimal journeys",
abstract = "Efficient public transport (PT) networks are vital for well-functioning and sustainable cities. Compared to other modes of transport, PT networks feature inherent systemic complexity due to their schedule-dependence and network organization. Because of this, efficient PT network planning and management calls for advanced modeling and analysis tools. These tools have to take into account how people use PT networks, including factors such as demand, accessibility, trip planning and navigability. From the PT user perspective, the common criteria for planning trips include waiting times to departure, journey durations, and the number of required transfers. However, waiting times and transfers have typically been neglected in PT accessibility studies and related decision-support tools. Here, we tackle this issue by introducing a decision-support framework for PT planners and managers, based on temporal networks methodology. This framework allows for computing pre-journey waiting times, journey durations, and number of required transfers for all Pareto-optimal journeys between any origin–destination pair, at all points in time. We visualize this information as a temporal distance profile, covering any given time interval. Based on such profiles, we define the best-case, mean, and worst-case measures for PT travel time and number of required PT vehicle boardings, and demonstrate their practical utility to PT planning through a series of accessibility case studies. By visualizing the computed measures on a map and studying their relationships by performing an all-to-all analysis between 7463 PT stops in the Helsinki metropolitan region, we show that each of the measures provides a different perspective on accessibility. To pave the way towards more comprehensive understanding of PT accessibility, we provide our methods and full analysis pipeline as free and open source software.",
keywords = "Transit, Routing, Temporal distance profile, Temporal network, GTFS, OpenStreetMap",
author = "Rainer Kujala and Christoffer Weckstr{\"o}m and Mladenović, {Miloš N.} and Jari Saram{\"a}ki",
year = "2018",
month = "1",
doi = "10.1016/j.compenvurbsys.2017.08.012",
language = "English",
volume = "67",
pages = "41–54",
journal = "Computers Environment and Urban Systems",
issn = "0198-9715",
publisher = "Elsevier Limited",

}

RIS - Lataa

TY - JOUR

T1 - Travel times and transfers in public transport: Comprehensive accessibility analysis based on Pareto-optimal journeys

AU - Kujala, Rainer

AU - Weckström, Christoffer

AU - Mladenović, Miloš N.

AU - Saramäki, Jari

PY - 2018/1

Y1 - 2018/1

N2 - Efficient public transport (PT) networks are vital for well-functioning and sustainable cities. Compared to other modes of transport, PT networks feature inherent systemic complexity due to their schedule-dependence and network organization. Because of this, efficient PT network planning and management calls for advanced modeling and analysis tools. These tools have to take into account how people use PT networks, including factors such as demand, accessibility, trip planning and navigability. From the PT user perspective, the common criteria for planning trips include waiting times to departure, journey durations, and the number of required transfers. However, waiting times and transfers have typically been neglected in PT accessibility studies and related decision-support tools. Here, we tackle this issue by introducing a decision-support framework for PT planners and managers, based on temporal networks methodology. This framework allows for computing pre-journey waiting times, journey durations, and number of required transfers for all Pareto-optimal journeys between any origin–destination pair, at all points in time. We visualize this information as a temporal distance profile, covering any given time interval. Based on such profiles, we define the best-case, mean, and worst-case measures for PT travel time and number of required PT vehicle boardings, and demonstrate their practical utility to PT planning through a series of accessibility case studies. By visualizing the computed measures on a map and studying their relationships by performing an all-to-all analysis between 7463 PT stops in the Helsinki metropolitan region, we show that each of the measures provides a different perspective on accessibility. To pave the way towards more comprehensive understanding of PT accessibility, we provide our methods and full analysis pipeline as free and open source software.

AB - Efficient public transport (PT) networks are vital for well-functioning and sustainable cities. Compared to other modes of transport, PT networks feature inherent systemic complexity due to their schedule-dependence and network organization. Because of this, efficient PT network planning and management calls for advanced modeling and analysis tools. These tools have to take into account how people use PT networks, including factors such as demand, accessibility, trip planning and navigability. From the PT user perspective, the common criteria for planning trips include waiting times to departure, journey durations, and the number of required transfers. However, waiting times and transfers have typically been neglected in PT accessibility studies and related decision-support tools. Here, we tackle this issue by introducing a decision-support framework for PT planners and managers, based on temporal networks methodology. This framework allows for computing pre-journey waiting times, journey durations, and number of required transfers for all Pareto-optimal journeys between any origin–destination pair, at all points in time. We visualize this information as a temporal distance profile, covering any given time interval. Based on such profiles, we define the best-case, mean, and worst-case measures for PT travel time and number of required PT vehicle boardings, and demonstrate their practical utility to PT planning through a series of accessibility case studies. By visualizing the computed measures on a map and studying their relationships by performing an all-to-all analysis between 7463 PT stops in the Helsinki metropolitan region, we show that each of the measures provides a different perspective on accessibility. To pave the way towards more comprehensive understanding of PT accessibility, we provide our methods and full analysis pipeline as free and open source software.

KW - Transit

KW - Routing

KW - Temporal distance profile

KW - Temporal network

KW - GTFS

KW - OpenStreetMap

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

U2 - 10.1016/j.compenvurbsys.2017.08.012

DO - 10.1016/j.compenvurbsys.2017.08.012

M3 - Article

VL - 67

SP - 41

EP - 54

JO - Computers Environment and Urban Systems

JF - Computers Environment and Urban Systems

SN - 0198-9715

ER -

ID: 15197199