Choice set generation algorithm suitable for measuring route choice accessibility

Nassir, Neema, Ziebarth, Jennifer, Sall, Elizabeth and Zorn, Lisa (2014) Choice set generation algorithm suitable for measuring route choice accessibility. Transportation Research Record, 2430: 170-181. doi:10.3141/2430-18

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads
UQ348806_OA.pdf Full text (open access) application/pdf 6.20MB 0

Author Nassir, Neema
Ziebarth, Jennifer
Sall, Elizabeth
Zorn, Lisa
Title Choice set generation algorithm suitable for measuring route choice accessibility
Journal name Transportation Research Record   Check publisher's open access policy
ISSN 0361-1981
Publication date 2014-11-03
Year available 2014
Sub-type Article (original research)
DOI 10.3141/2430-18
Open Access Status File (Publisher version)
Issue 2430
Start page 170
End page 181
Total pages 12
Place of publication Washington, DC, United States
Publisher U.S. National Research Council, Transportation Research Board
Collection year 2015
Language eng
Abstract A new algorithm that generated a set of paths between a pair of origin-destination nodes in a transportation network for the purpose of generating a measure of accessibility on the level of route choice was designed, developed, and tested. The proposed algorithm incorporated the well-known issue of path overlap in the process of generating the path choice set. This algorithm fit naturally into the class of iterative penalty-based Kth-shortest-path algorithms; in this class the link penalty terms are designed to reflect the amount of overlap between the paths already generated. With the proposed algorithm, paths were generated in order of decreasing utility and corrected by a path size correction factor; it was thus highly efficient in the sense that a comparatively small number of paths could result in a broad spectrum of desirable choices. The algorithm was developed in response to the Valencia paradox, which arose from using logsums from the existing algorithm for choice set generation as a route-level accessibility measure for the bicycle network in San Francisco, California. The Valencia paradox occurs when an accessibility measure decreases following an improvement to actual network accessibility. A detailed case study demonstrated the effectiveness of the proposed algorithm in minimizing this kind of paradoxical result and generating a route-level accessibility measure suitable for making fine-grained planning decisions.
Q-Index Code C1
Q-Index Status Confirmed Code
Institutional Status UQ

Document type: Journal Article
Sub-type: Article (original research)
Collections: School of Civil Engineering Publications
Official 2015 Collection
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 2 times in Thomson Reuters Web of Science Article | Citations
Google Scholar Search Google Scholar
Created: Sun, 11 Jan 2015, 00:42:46 EST by System User on behalf of School of Civil Engineering