Abstract
ABSTRACT A new approach is presented to evaluate route choice set generation algorithms, which is based on comparing algorithm-generated choice sets for an origin-destination (OD) location pair against the portfolio of observed routes for that OD pair. The approach offers the ability to evaluate both the generation of relevant routes that are considered by travelers and the generation of extraneous routes that are seldom chosen. The approach is used to evaluate the performance of a breadth-first search link elimination (BFS-LE) algorithm to generate route choice sets for freight trucks. Based on the evaluation, the paper offers guidance on effectively using BFS-LE to maximize generation of relevant routes. It is found that aggregating route choice sets across trips with spatially proximate trip ends can reduce the need to generate large choice sets for each trip. However, such spatial aggregation might yield greater benefits if extraneous routes are eliminated from the choice sets.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
