{'fraction_non_alphanumeric': 0.02576808721506442, 'fraction_numerical': 0.0, 'mean_word_length': 4.976331360946745, '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}}
A quasi-dynamic assignment model that guarantees unique network equilibrium

This article formulates a discrete-time dynamic traffic assignment (DTA) model and, under certain conditions, shows the existence and uniqueness of network equilibrium. Several theoretical issues need to be tackled. The inflow to a link in a particular discrete (time) period does not necessarily exit within the same period. We consider how flow is passed from one link and period to the next, and the corresponding costs. Under the proposed model, flow departing within a discrete period may experience different link travel times in different discrete periods, even if the flow chooses a single route. Route travel time must then be defined so that route and OD costs are meaningful. To this end, quasi-real route travel time is defined. Based on this definition, a quasi-equilibrium condition for DTA is proposed; a semi-dynamic analogue of user equilibrium. The existence and uniqueness of this equilibrium solution are proven.