An open-source program for spatial decomposition of bus transit networks
Bibliographic Data
| ID | 21246924 |
|---|---|
| Authors | Nicholas S Caros (0000-0002-1060-6781, Massachusetts Institute of Technology, corresponding author), Anson Stewart (0000-0002-3862-1393, Massachusetts Institute of Technology), John Attanucci (Massachusetts Institute of Technology) |
| Year | 2023 |
| Volume | 50 |
| Issue | 5 |
| Pages | 1394-1401 |
| Publication date | 2023-06-01 |
| Peer Reviewed | Yes |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | Environment and Planning B Urban Analytics and City Science (JOURNAL) |
| Journal identifiers | ISSN: 2399-8083 • E-ISSN: 2399-8091 |
| Publisher | SAGE Publications (PUBLISHER • US) |
| DOI | 10.1177/23998083231174892 |
| OpenAlex | W4367394511 |
| Language | EN |
| References cited | 16 |
Comparing transit operations and performance over time is often challenging due to changes in route identifiers and service patterns. It is particularly difficult if the analysis period spans a major network design change where bus routes are realigned and renamed. This paper presents a new open-source software package that simplifies longitudinal transit performance analysis by decomposing a bus network into block-length segments that remain stable over time. The package then matches transit networks across time periods using segment geometry rather than potentially unstable route or stop identifiers. This package provides an efficient method for transit planners, advocacy groups, policy makers and urban scientists to analyze changes in transit performance over time without any prior knowledge of network design changes
Bus network · Computer network · Control bus · Decomposition · Identifier · Open source · Operating system · Public transport · System bus · Transport engineering · Computer Science · Engineering · Human Mobility and Location-Based Analysis · Transportation Planning and Optimization · Urban Transport and Accessibility · Software
| Citation velocity | historical |
|---|---|
| Highly cited | No |