{'fraction_non_alphanumeric': 0.018518518518518517, 'fraction_numerical': 0.0, 'mean_word_length': 5.397849462365591, '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}}
Comparison of Disaggregate Simplicial Decomposition and Frank-Wolfe Algorithms for User-Optimal Route Choice

The disaggregate simplicial decomposition (DSD) method has been posed as a better alternative to existing algorithms for solving the deterministic user-optimal route choice model. The application of the DSD algorithm is compared and evaluated with the commonly used Frank-Wolfe (FW) algorithm on a large network in the Chicago area. The results indicate that the DSD algorithm performs much better than the FW with respect to reaching the optimality conditions specified by the model.