{'fraction_non_alphanumeric': 0.015165876777251185, 'fraction_numerical': 0.0, 'mean_word_length': 5.323353293413174, '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 Dynamic Traffic Assignment Method Based on Connected Transportation System

This paper proposed a dynamic traffic assignment method based on the connected transportation system to express the time-varied traffic flows caused by uncertain traffic demand and supply in the real traffic network accurately. In dynamic traffic assignment, because of the cumulative volumes of successive time intervals, a route-based traffic assignment algorithm is used for dynamic traffic assignment in this paper. Besides, a novel shortest path algorithm based actual and artificial link is proposed for the time-expanded network that consists of two kinds of arcs: the actual arc and the artificial one. Then, a simple example is used to illustrate the performance of the proposed method. The computational results show that the novel shortest path algorithm based actual and artificial link could be applied in the time-expanded networks with two types of arcs, and the route-based assignment method could achieve optimal balance solutions under different demand modes.