Representation and modeling of adaptive algorithms for control of transport systems in the form of finite hierarchical automata

Abstract

Formulation of the problem. The article discusses the problem of planning transportation within the framework of one motor transport enterprise (ATP) on the basis of available vehicles (TS). The complexity of the task lies in the presence of restrictions on the ability to fulfill hotel orders with their own vehicles. The problem is also represented by the choice of a mechanism for distributing orders among the existing vehicles when setting various criteria for assessing the efficiency of the ATP for the planning period. The aim of the work is to build a formal model of algorithms for adaptive traffic management within the ATP's own vehicle fleet for modeling the process of transporting goods and assessing the effectiveness of the chosen strategy for various traffic flow schemes and flows of transportation orders. Results. There are many different adaptive algorithms for traffic management for a different vehicle fleet. Moreover, each algorithm has its own representation in the form of some formal scheme. The paper proposes a universal mechanism for describing the entire set of adaptive algorithms in the form of a finite state machine. In addition, when considering a multilevel scheme for representing the control structure of ATP, the article proposes a hierarchical automaton scheme for representing adaptive algorithms. Practical significance. The results obtained make it possible, when choosing a specific control algorithm, to construct a finite hierarchical automaton, which makes it possible to evaluate the effectiveness of the selected control strategy.