Treffer: Performance evaluation of path choice set generation algorithms for route choice modelling.

Traffic assignment and its applications are sensitive to the selection of path choice sets between an OD pair. In literature, different path generation algorithms are proposed, namely, Link Labeling, Link Elimination, Link Penalty, Simulation, and Branch and Bound. The effectiveness of these algorithms hinges on algorithmic principles and input parameters. Consequently, choosing an appropriate algorithm for practical implementation becomes challenging. This paper aims to benchmark these algorithms with a case study using a real vehicle trajectory dataset from four OD pairs from Brisbane, Australia. The paper offers both qualitative and quantitative comparisons of the algorithms. The performance of the algorithms is evaluated based on their authenticity, redundancy, and applicability. The results highlight that the simulation method outperforms the other algorithms, specifically utilizing a truncated normal distribution. The paper offers valuable insights into the selection of path-generation techniques, aiding the enhancement of traffic assignment processes. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Intelligent Transportation Systems is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)