Refactoring as complexity decreasing instrument of representation of traffic flow models based on cellular automata

Abstract

This paper combines results of several papers published by the author. In particular, results of analysis and creation of a new common representation of the traffic flow models based on the cellular automata theory are used. The necessity of transition to the four-stepped unified representation of the considered models group is justified. The refactoring approach that is applicable for the most models of the considered group is formulated based on the revised representation of the next models: Rule 184, Nagel-Schreckenberg model, Slow-to-Start Rule model, Multifactorial model and Adaptive Deceleration model. As the result of the described refactoring approach application, we have got a quite similar representation of the different models of the considered group; without a doubt, it makes it easier to sense these models group key concepts and decrease the barrier to entry for novices in this transportation modeling realm.