{'fraction_non_alphanumeric': 0.01456726649528706, 'fraction_numerical': 0.0, 'mean_word_length': 5.870588235294117, '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}}
Supernetworks for Combined Travel Choice Models

A supernetwork is usually defined as an augmented network that consists of a “basic network” for route choice and a “virtual network” for other travel choices. Supernetwork representations are useful pedagogical devices to interpret various combined travel choice models as an extension of the fixed demand traffic assignment problem. Based on three proposed criteria, this paper reviews current supernetworks and modifies them as needed for better representation. A nested combined model consisting of four choices subject to variable demand is described with an example. Using supernetwork representations, combined travel choice models have great potential to become more popular than sequential four-step travel demand forecasting, even with feedback. In addition, recently developed quick-precision traffic assignment algorithms could be more efficient than traditional multistage solution algorithms for solving combined travel choice models. The proposed new supernetwork representations can be extended to other network problems in the supply chain network or other economics networks with minor modifications.