{'fraction_non_alphanumeric': 0.022307692307692306, 'fraction_numerical': 0.0, 'mean_word_length': 5.2548076923076925, '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 DOUBLY DYNAMIC TRAFFIC ASSIGNMENT MODEL FOR PLANNING APPLICATIONS

A traffic assignment model is presented that simulates the process of users' choice in a day-to-day dynamic framework and also the traffic dynamics "within" each single simulated day. It can therefore be considered a doubly dynamic model, being day-to-day dynamic to represent user path choice and within-day dynamic to represent user movement on the network. The model has fixed departure times; origin-destination demand flows are assumed known at each interval within the simulated period. Path choice behavior is modeled considering explicitly learning or information updating processes for experienced path costs. The users' choice adjustment process takes into account the inertia to day-to-day path changes. Path choices are simulated by applying a C-logit random utility model, that allows the effects of links shared between similar paths to be simulated, keeping an analytical expression of choice probability. The Network Flow Propagation model adopted in the dynamic traffic assignment proposed in this paper, is based on a mesoscopic simulation model and explicit path enumeration. The model is intended mainly for planning applications; computation times, at the moment, are not compatible with real time application.