Сегментация транспортной сети по свойству отделимости для формирования системы транспортного узла

Abstract

The article considers the problem of segmenting the interrelated terminals of a transport network into a fixed number of relatively autonomous transport hubs when solving transport technical problems. There has been proposed a most common and simple option for solving the graph partition problems - a problem of segmenting the transport network by r-partitioning. Useful practical approaches to solving the problem are studied. There has been proposed an assessing version for developing the transport network segmentation procedures and their content-richness. A heuristic procedure for the transport network segmentation by separation property for building the transportation hub system is defined. For the considered heuristic procedures of solving the set problem there is conducted the study of heuristic procedure properties and assessed the worst scenarios. It is found that the segmentation of the regional transport network into separate transport hubs using the described procedures can be carried out for the subclass of separable tiling or separable on average tiling, if no further possible improvements could be assessed. The considered procedures of the regionʼs transport network graph segmentation have one common feature: these procedures preserve some beneficial properties in tiling obtained in the course of building the transportation hub. It has been stated that the procedures can serve as a ground in the synthesis of a hierarchical group represented as a chain of inner tilings, each being “good” in terms of cluster analysis. The assessment richness of the transport network partitioning into the transport hubs is analyzed using a computational experiment.