Calibrated Labeling Method for Generating Bicyclist Route Choice Sets Incorporating Unbiased Attribute Variation

Author(s):  
Joseph Broach ◽  
John Gliebe ◽  
Jennifer Dill
Author(s):  
Sascha Hoogendoorn-Lanser ◽  
Rob van Nes ◽  
Piet Bovy

Travelers in multimodal networks make many choices (e.g., main mode, access modes, egress modes, boarding nodes, transfer nodes, and egress nodes). One way to address this complexity of choices is to analyze choice sets of multimodal routes. However, choice sets for multimodal networks are large, and overlap of routes within choice sets is substantial. This paper focuses on overlap in multimodal transport networks. An overview of the topic of overlap and route choice modeling is given and is followed by an analysis of how overlap might be defined in the context of multimodal networks. Three definitions of “overlap” are proposed, based on number of legs, time, or distance. The different definitions are analyzed using path size logit estimations, which show that path size must be accounted for. Furthermore, the definition of “path size” for multimodal transport networks should be different from that used for road networks: for multimodal transport networks, a definition using number of legs yields substantially better results. Estimation results suggest that the weighting parameter corresponding with the path size variable should be equal to 1, implying that the path size variable based on number of legs accounts for the correlation of error terms of overlapping parts.


Author(s):  
Thomas Koch ◽  
Luk Knapen ◽  
Elenna Dugundji

AbstractEveryday route choices made by bicyclists are known to be more difficult to explain than vehicle routes, yet prediction of these choices is essential for guiding infrastructural investment in safe cycling. Building route choice sets is a difficult task. Even including detailed attributes such as the number of left turns, the number of speed bumps, distance and other route choice properties we still see that choice set quality measures suggest poor replication of observed paths. In this paper we study how the concept of route complexity can help generate and analyze plausible choice sets in the demand modeling process. The complexity of a given path in a graph is the minimum number of shortest paths that is required to specify that path. Complexity is a path attribute which could potentially be considered to be important for route choice in a similar way. The complexity was determined for a large set of observed routes and for routes in the generated choice sets for the corresponding origin-destination pairs. The respective distributions are shown to be significantly different so that the choice sets do not reflect the traveler preferences, this is in line with classical choice set quality indicators. Secondly, we investigate often used choice set quality methods and formulate measures that are less sensitive to small differences between routes that can be argued to be insignificant or irrelevant. Such difference may be partially due to inaccuracy in map-matching observations to dense urban road networks.


2017 ◽  
Vol 75 ◽  
pp. 183-196 ◽  
Author(s):  
Maëlle Zimmermann ◽  
Tien Mai ◽  
Emma Frejinger

2021 ◽  
Vol 90 ◽  
pp. 102903
Author(s):  
Darren M. Scott ◽  
Wei Lu ◽  
Matthew J. Brown
Keyword(s):  
Gps Data ◽  

2013 ◽  
Vol 9 (9) ◽  
pp. 825-845 ◽  
Author(s):  
Nadine Rieser-Schüssler ◽  
Michael Balmer ◽  
Kay W. Axhausen

Sign in / Sign up

Export Citation Format

Share Document