{'fraction_non_alphanumeric': 0.018502943650126155, 'fraction_numerical': 0.0, 'mean_word_length': 5.296296296296297, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Performance evaluation of choice set generation algorithms for analyzing truck route choice: insights from spatial aggregation for the breadth first search link elimination (BFS-LE) algorithm

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.