{'fraction_non_alphanumeric': 0.017813765182186234, 'fraction_numerical': 0.0, 'mean_word_length': 5.338461538461538, '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}}
Incorporating within link dynamics in an agent-based computationally faster and scalable queue model

ABSTRACT The growing pace of urbanization increases the need of simulation models to handle large-scale scenarios in reasonable time. The present study proposes a fast spatial queue model, which is anchored to an agent-based travel demand simulation framework. The existing queue model is extended to produce more realistic flow dynamics by introducing backward travelling holes to mixed traffic conditions. In this approach, the space freed by a leading vehicle is not immediately available to the following vehicle. The resulting dynamics resembles Newell's simplified kinematic wave model. The space freed corresponding to each leaving vehicle is named as ‘hole’ and, as following vehicles occupy the space freed by leading vehicles, the hole travels backward. This results in triangular fundamental diagrams for traffic flow. The robustness of the model is tested with flow density and average bike passing rate contours. Spatio-temporal trajectories are presented to differentiate the queuing patterns. Finally, a comparison of the computational performance of the different link and traffic dynamics of the queue model is made.