Conceptual bases for managing the processing and distribution of discrete flows in a multicommodity communication network. Part I. Hierarchical structure of the network and principles of sorting and distribution of flows
The article discusses methodological approaches to the construction of multicommodity hierarchical communication networks and identifies the main tasks of processing and distribution of discrete correspondence flows, which allow to create favorable conditions for reducing material, financial and lab...
Saved in:
| Published in: | Проблеми керування та інформатики |
|---|---|
| Date: | 2025 |
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Інститут кібернетики ім. В.М. Глушкова НАН України
2025
|
| Subjects: | |
| Online Access: | https://nasplib.isofts.kiev.ua/handle/123456789/211370 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Cite this: | Conceptual bases for managing the processing and distribution of discrete flows in a multicommodity communication network. Part I. Hierarchical structure of the network and principles of sorting and distribution of flows / V. Vasyanin, O. Trofymchuk // Проблемы управления и информатики. — 2025. — № 2. — С. 22-33. — Бібліогр.: 39 назв. — англ. |
Institution
Digital Library of Periodicals of National Academy of Sciences of Ukraine| _version_ | 1859576089933774848 |
|---|---|
| author | Vasyanin, V. Trofymchuk, O. |
| author_facet | Vasyanin, V. Trofymchuk, O. |
| citation_txt | Conceptual bases for managing the processing and distribution of discrete flows in a multicommodity communication network. Part I. Hierarchical structure of the network and principles of sorting and distribution of flows / V. Vasyanin, O. Trofymchuk // Проблемы управления и информатики. — 2025. — № 2. — С. 22-33. — Бібліогр.: 39 назв. — англ. |
| collection | DSpace DC |
| container_title | Проблеми керування та інформатики |
| description | The article discusses methodological approaches to the construction of multicommodity hierarchical communication networks and identifies the main tasks of processing and distribution of discrete correspondence flows, which allow to create favorable conditions for reducing material, financial and labor costs in transport systems with further mechanization and automation of production.
У статті розглянуто методологічні підходи до побудови багатопродуктових ієрархічних комунікаційних мереж та визначені основні задачі обробки і розподілу дискретних потоків кореспонденцій, що створюють сприятливі умови для скорочення матеріальних, фінансових і трудових витрат в транспортних системах при подальшій механізації та автоматизації виробництва.
|
| first_indexed | 2026-03-13T19:25:56Z |
| format | Article |
| fulltext |
© V. VASYANIN, O. TROFYMCHUK, 2025
22 ISSN 2786-6491
МЕТОДИ ОПТИМІЗАЦІЇ ТА ОПТИМАЛЬНЕ КЕРУВАННЯ
UDC 519.854.2
V. Vasyanin, O. Trofymchuk
CONCEPTUAL BASES FOR MANAGING
THE PROCESSING AND DISTRIBUTION
OF DISCRETE FLOWS IN A MULTICOMMODITY
COMMUNICATION NETWORK.
Part I. HIERARCHICAL STRUCTURE
OF THE NETWORK AND PRINCIPLES OF SORTING
AND DISTRIBUTION OF FLOWS
Volodymyr Vasyanin
Institute of Telecommunications and Global Information Space of the NAS of Ukraine,
Kyiv,
https://orcid.org/0000-0003-4046-5243
archukr@meta.ua
Oleksandr Trofymchuk
Institute of Telecommunications and Global Information Space of the NAS of Ukraine,
Kyiv,
https://orcid.org/0000-0003-3358-6274
itgis@nas.gov.ua
The article discusses methodological approaches to the construction of multi-
commodity hierarchical communication networks and identifies the main tasks
of processing and distribution of discrete correspondence flows, which allow to
create favorable conditions for reducing material, financial and labor costs in
transport systems with further mechanization and automation of production.
Multicommodity communication networks are characterized by the presence of
a multitude of sources and drains of correspondence flows (products or require-
ments). Correspondence is understood as a pair of different network nodes, be-
tween which there is a directed (addressed) discrete flow of elements (for exam-
ple, indivisible loads of uniform size, bits or symbols) of a given size. In a mul-
ticommodity network, all correspondence flows are subject to a one-time
transfer from sources to drains. In general, a certain set of types (categories) of
correspondence can be defined on the network, differing in weight, dimensions
and other characteristics, but having common sources and drains. The hierar-
chical structure of the network and the principles of sorting, distribution and
routing of flows are given.
Keywords: hierarchical multicommodity communication networks, discrete cor-
respondence flows, principles and technology of processing and transportation
of flows in the zonal-nodal structure of the network, problems of long-term and
current planning and operational management, information-analytical decision
support system.
https://orcid.org/0000-0003-4046-5243
mailto:archukr@meta.ua
https://orcid.org/0000-0003-3358-6274
mailto:itgis@nas.gov.ua
Міжнародний науково-технічний журнал
Проблеми керування та інформатики, 2025, № 2 23
Introduction
The modern period of development of socio-economic processes in Ukraine is
characterized by their dynamics and complexity, improvement of the management
structure of public authorities, transformation of traditional, existing and emergence of
new information public relations that determine the transition of society from industrial
to informational. This creates the need to increase the role of information and new in-
formation technologies, the formation of a single information space of the country, the
improvement of information support for the activities of public authorities and econom-
ic entities.
In accordance with the Law of Ukraine «On the concept of the national in-
formatization program» (dated February 4, 1998, N 75/98-VR, current version dated
01.01.2022)1, information technologies are defined as components of the national in-
formation infrastructure and are designed to ensure the economic recovery of the coun-
try. The implementation of the process of informatization during the formation of
Ukraine as an independent state in the conditions of military operations of the Russian
aggressor and the crisis state of the economy and limited resources is possible only by
identifying priority areas and directions with the concentration of financial, material and
labor resources on them.
One of the priority sectors of development of the economy of Ukraine in the Na-
tional Program of Informatization is transport and communications, the increase in the
efficiency of functioning of which requires the creation of applied mathematical soft-
ware for solving the problems of optimizing transport processes, information and ana-
lytical systems for supporting decision-making for managing the processing and distri-
bution of traffic flows and a complex of automated data processing systems of various
levels and purposes. Therefore, the automation of information processes in the man-
agement of transport flows in state and corporate communication networks is a promis-
ing direction in achieving a qualitatively new level of transport and communication
management and Ukraine's integration into the European Community. Due to the im-
portance of the transport complex for the intensification of market transformations in
Ukraine, the proposed methodology for the analysis and design of communication net-
works is mainly aimed at solving the problems of ensuring the normal functioning of
transport systems in the infrastructure complexes of large cities, regions and the country
as a whole. However, it can be successfully applied to other network structures, such as
data transmission networks, cellular and postal networks, etc.
Due to the importance of this issue for the intensification of market transformations
in Ukraine and, in particular, in the field of cargo transportation, the paper examines the
problems of mathematical modeling and design of multicommodity communication
networks with discrete correspondence flows, as well as provides the conceptual foun-
dations for managing the processing and distribution of flows in a hierarchical network.
In most cases, there are existing and designed territorially distributed communica-
tion networks — transport, information and computing, fuel and energy, postal, tele-
graph, telephone, etc. are multi-level and consist of a decentralized distributed network
(backbone) and grassroots fragmentary networks (zonal and internal) at the lower levels
of the hierarchy. The number of levels of the hierarchy is determined by the administra-
tive division of the territory, the subordination of territorial government bodies, the
adopted technology for processing and distributing cargo and information flows, etc.
In this paper, multicommodity transport networks and data transmission networks
are considered, which are characterized by the presence of a multitude of sources and
drains of correspondence flows (products or commodity, requirements).
1 https://zakon.rada.gov.ua/laws/show/75/98-%D0%B2%D1%80?lang=en#Text
https://zakon.rada.gov.ua/laws/show/75/98-%D0%B2%D1%80?lang=en#Text
24 ISSN 2786-6491
The efficiency of communication networks largely determines the economic and
social indicators of the functioning of the infrastructure of most economic entities. Sta-
bilization and improvement of the country's economy, especially in the context of the
global economic crisis, require further development and modernization of network
structures. In order for the possible investments allocated for the development of infra-
structures to be used in the most efficient way, a strict feasibility study is required, co-
vering the main alternative schemes for their development and functioning. It is neces-
sary to assess and select various options for improving infrastructures on the basis of
optimization procedures and system analysis of the effects that arise within the links of
infrastructures, as well as outside them, which indirectly affect the development and
state of the economy of individual territorial regions and the country as a whole. Sol-
ving the problems of long-term infrastructure development will allow step-by-step, ta-
king into account the amount of investments received, to form an optimized structure of
objects and connections of the transport network.
At present, the existing network infrastructures in various sectors of the economy
are characterized by the fact that various automated and information systems have al-
ready been introduced at all levels of management. Their further development with the
use of the latest information technologies is envisaged; modern methodological, tech-
nical and mathematical support; decision support systems that rationally combine for-
mal and informal decision-making methods and an interactive mode of analysis and se-
lection of optimal solutions. There is also a structure of information and computing
networks that ensure the functioning of communication systems and include global,
corporate and local data transmission networks, switching and data transmission equip-
ment, etc.
Since the physical spatial structure of most existing networks has already been
formed, first of all, the most interesting is the solution of the problems of current plan-
ning and operational management, aimed mainly at optimizing their functioning with
available resources.
Within the framework of projects to automate decision-making processes for the
optimal development and functioning of hierarchical communication networks, the fol-
lowing should be considered:
• mathematical models, methods and algorithms for solving problems of optimi-
zing multi-stage management of the infrastructure development of such networks, ta-
king into account all the possibilities of their qualitative organizational and technical
improvement;
mathematical models, methods and algorithms for solving problems of optimal
functioning of network structures at the levels of current planning and operational ma-
nagement;
methods of decision analysis using knowledge bases and the involvement of pro-
fessional experts, which allow you to make decisions in an interactive mode for the
above tasks;
information support based on the latest innovations in the field of database crea-
tion and database management systems.
One of the main factors in the growth of the efficiency of transport networks with
discrete correspondence flows is the introduction of container transportation technolo-
gy, in which discrete correspondence is packed in transport blocks (containers) before
being sent to the recipient. At the same time, elements with different recipient addresses
can fall into one transport block. The obvious advantages of container technology in-
clude: increasing the level of mechanization and automation of loading and unloading
operations; reduction of time for unloading and loading of goods at transit hubs on the
routes of vehicles; reducing the volume of manual labor and reducing the number of un-
Міжнародний науково-технічний журнал
Проблеми керування та інформатики, 2025, № 2 25
skilled workers; increasing the safety of goods and accompanying documents; the abi-
lity to store containers in open areas. At the same time, a one-time film package can be
used as a «container», in which a given number of single correspondence is packed. The
use of cheap, but sufficiently durable film packaging eliminates the need to maintain a
fleet of specialized expensive containers and solve the problem of optimizing the deli-
very of empty containers at the levels of current planning and operational management
in the management of the container fleet. In addition, the payload of vehicles increases
significantly. The size (volume) of the transport unit can vary within certain limits de-
pending on various characteristics of single correspondence — size, cost, priority, etc.
The dimensions of the transport units must be multiples of the capacity (carrying ca-
pacity) of the vehicles. It is assumed that there are many vehicles with different carrying
capacity, for example, 10, 15, 20 conditional transport blocks, etc.
Despite the obvious «attractiveness» of container technology, in recent years the
volume of container transportation of correspondence in Ukraine has not been increa-
sing intensively enough. For example, the United States transports more than 15 billion
tons of discrete cargo annually for a total value of more than 9 trillion dollars, and reve-
nues from the transportation of goods account for about 11 % of gross national produc-
tion of the United States. Tens of thousands of cars and hundreds of jet aircraft are used
daily to transport such goods in trailers (containers) in the United States [1, 2]. The
main reasons for this are the organizational and technical unpreparedness of transport
enterprises for the introduction of modern information and analytical systems, technolo-
gies and tools for computer-aided design, management and decision-making, including
the use of situational centers for processing and presentation of information. In addition,
the existing automated logistics transport systems do not implement scientifically
grounded methods of mathematical modeling of cargo transportation and, accordingly,
there are no tools for managing such transportation. The implementation of the results
of the work will eliminate the existing gap in this area and improve the service of citizens
and various private and public enterprises with transport services for the door-to-door
transportation of goods.
In conclusion, it should be noted that a similar technology of virtual containers, in
which connections with different destination addresses can be combined into one virtual
container, is used in the construction of promising large-scale nationwide and interna-
tional data transmission networks based on ultra-wideband channels and backbone
schemes (known, for example, the European backbone network e-bone). Currently, the
design of such networks uses the channel switching method, the European technology
of synchronous digital hierarchy (SDH) or the American technology of synchronous op-
tical networks (Synchronous Optical Nets — SONET) using fiber-optic communication
lines. In circuit-switched networks, any communication line has a bandwidth that is a
multiple of the elementary channel, which is a basic technical characteristic that repre-
sents a fixed value of bandwidth (in telephone networks, as a rule, the bandwidth of the
elementary channel is 64 Kbit/s). In circuit-switched networks, the bandwidth of each
communication line must be equal to an integer number of elementary channels. This
allows you to create reliable networks and flexible form digital channels in a wide range
of speeds — from a few megabits to tens of gigabits per second. For example, in the
systems of spectral channel compaction WDM (Wavelength — Division Multiplexing),
DWDM (Dense WDM), HDWDM (High Dense WDM), which allow simultaneous
transmission of several information channels over one optical fiber at different carrier
frequencies, it is possible to multiplex from 16 to 64 or more spectral channels with a
bandwidth of 40 Gbit/s and more. These technologies make it possible to significantly
increase the capacity of communication lines, and they make it possible to use already
laid fiber-optic lines, to organize two-way multi-channel traffic transmission along one
fiber. The advantage of DWDM systems is the ability to transmit a high-speed signal
26 ISSN 2786-6491
over ultra-long distances without regenerating the signal by amplifiers at intermediate
points. SDH multiplexers with fiber-optic communication lines between regional sub-
nets, to which local networks are connected, form an environment in which digital
channels are formed between connection points to the backbone network. SDH net-
works belong to the class of circuit-switched networks based on time division multi-
plexing (TDM), in which the addressing of information from individual subscribers is
determined by its relative time position within the composite frame, and not by an ex-
plicit address, as is the case in packet-switched networks. SDH channels belong to the
class of semi-permanent — the channel is formed at the initiative of the SDH network
operator, while users are deprived of such an opportunity, so such channels are usually
used to transmit fairly stable streams over time. Due to the semi-permanent nature of
connections, SDH technology more often uses the term «cross-connect» rather than
switching. SDH channels are usually used to combine a large number of peripheral (and
slower speed) channels of the plesiochronous digital hierarchy (PDH).
Therefore, some results of the work, namely mathematical models of problems of
processing and transportation of correspondence flows, can be used for the design of
backbone data transmission networks with the technology of virtual containers.
The object of the study is the processes of processing and distribution of discrete
flows in multicommodity networks, and the purpose of the work is to increase the effi-
ciency of functioning of multicommodity communication networks by reducing scarce
material, raw materials, energy, financial and labor costs on the basis of the proposed
methodology for modeling and designing the processes of processing and distribution of
discrete flows and a set of measures for information and analytical support and automa-
tion of acceptance procedures solutions in the management of traffic flows.
Hierarchical structure of the network and principles of sorting
and distribution of flows
Recall that the number of hierarchy levels in the network is determined by the ad-
ministrative division of the territory, the subordination of territorial authorities, the
adopted technology for processing and distributing cargo and information flows, etc.,
and correspondence (product, demand) is understood as a pair of different network
nodes, between which there is a directed (addressed) discrete flow of elements of a gi-
ven value. In a multicommodity network, all correspondence flows are subject to a one-
time transfer from sources to drains. In general, a certain set of types (categories) of cor-
respondence can be defined on the network, differing in weight, dimensions and other
characteristics, but having common sources and drains.
Each node in a hierarchical network has a name, a unique index, and a sequence
number. Each node can be matched with a set of indices (numbers) of other nodes cor-
responding to it in the backbone and internal network. In a multicommodity network,
each node can exchange correspondence (messages, cargo) with all other nodes. Corre-
spondence is characterized by a source node, a drain node and a value, which for data
transmission networks is given by the number of bytes, kilobytes, etc., and for transport
networks by the number of packaged goods in a package of a uniform size.
In the backbone network, all correspondence is transmitted via communication
channels or transported in vehicles in transport blocks of a given size (capacity, vo-
lume). The size of the transport unit is measured by the number of units of correspon-
dence that fit into it (for example, 64 KB, 40 packaged cargo). All trunk nodes are sor-
ting centers in which correspondence is first sorted by destination addresses (nodes) and
then packed into transport blocks. In data networks, data transmission multiplexers play
the role of sorting centers, and a virtual container acts as a transport unit. Since the size
of individual correspondence is much smaller than the size of the transport block, they
can be combined (packed) several times and in different nodes with correspondence
Міжнародний науково-технічний журнал
Проблеми керування та інформатики, 2025, № 2 27
with different destination addresses during sorting (multiplexing). With such consolida-
tion of correspondence in the network nodes, the number of directions for their sorting
and the number of transport blocks required for their packaging to be reduced, but in
some nodes there are additional volumes of sorting correspondence that have not
reached the address of their destination. In addition, the time of delivery to the recipient
of correspondence, which undergoes additional sorting at transit hubs, increases.
In the inner zone of each trunk node there are nodes for the delivery and collection
of correspondence (clients of the data transmission network or transport network),
which can exchange correspondence with each other and with other nodes of the hierar-
chical network only through this trunk node. The transmission or transportation of cor-
respondence in the internal network is carried out by regional providers or along the
routes of internal vehicles.
There are three levels of hierarchy in the network — trunk, zonal, and internal — and
four types of nodes — nodes of the first, second, third, and fourth types. Nodes of the first,
second and third types, located on the transport highways of transport network or data net-
works and connecting their sections of vehicle routes or communication channels, constitute
the backbone network. All backbone nodes have service zones (SZ) that form the zonal le-
vels of the backbone network. Nodes of the fourth type are located in the internal service ar-
ea of any trunk node and together with it form an internal network.
Fig. 1 shows fragments of a three-level network, where ,i ,j k — trunk nodes
with their own trunk service zones, m — nodes of delivery and collection of corre-
spondence in the internal service area of each trunk node (internal networks).
Nodes of the first type can sort flows to all trunk nodes in their service area and to
all other nodes of the first type in the backbone network. In the nodes of the second and
third types, the number of trunk directions for sorting flows is limited by the number of
nodes located inside and at the border of their service zones. Therefore, in the backbone
network, after sorting the flows of correspondence and packing them into transport
blocks, there can be no direct flow of transport blocks between the nodes of the first
type and the nodes of the second or third type and vice versa, if they are not in the same
service zones. Nodes of the second and third types differ from nodes of the first type in
functionality, level of technical equipment, number of service personnel, etc., in these
nodes it is forbidden to sort transit flows of correspondence (except for flows between
nodes of the fourth type in the internal network). In the nodes of the third type, in con-
trast to the nodes of the second type, it is forbidden to process the transit flows of
transport blocks. In nodes of the fourth type, the flows are not sorted, but are directly
sent to the corresponding trunk node.
Fig. 1
In [3] discusses the generalized problem of packaging and distribution of corre-
spondence flows in a hierarchical network, the solution of which is carried out in seve-
ral stages. At the first stage, the problem of choosing the hierarchical structure of the
j
SZ of nodes
of 1-type Internal service
area of trunk
node
SZ of nodes
of 2-type
SZ of nodes
of 3-type
i
k
m
28 ISSN 2786-6491
backbone network and the scheme of sorting correspondence in the network nodes and
packing them into transport blocks is solved [4–10]. At the second stage, the problem of
distribution and routing of flows of transport blocks with groupage correspondence,
which were formed during the solution of the first problem, arises [11–19].
Groupage correspondence means messages combined into one transport block or
packaged cargoes with different addresses of destination, which may not coincide with
the address of destination of the transport block. Groupage correspondence is formed to
minimize the number of transport units required for their packaging and transfer or
transportation in the backbone network.
In the foreign literature, the problems of designing such networks are called multi-
echelon location-routing problem (ME LRP) [20–29]. In multi-stage LRPs, there are sev-
eral intermediaries between the backbone nodes (central primary facilities) and the nodes
in the inner zones of the trunk nodes (end users, customers), and the product distributed
from the backbone nodes passes through two or more secondary intermediaries in the
network (satellites) to the end user. In the classical LRP, two problems are combined for a
joint solution: the problem of determining the location of secondary objects (satellites or
depots) and the main routes of vehicles, and the problem of constructing circular routes of
internal vehicles to serve customers with a known demand for a homogeneous inter-
changeable product. In contrast to the distribution problems of a homogeneous interchange-
able product, in multi-product LRP (Multi-Commodity Location-Routing Problem — MC
LRP) problems [30–36], the product flows are not interchangeable, the flow of each prod-
uct must be delivered from a specific primary object to a specific customer.
In this work, it is assumed that the multi-level structure of the transport network is
defined and the geographical location of the main nodes and its internal service areas
with a set of nodes for the delivery and collection of goods (customers) are known.
Therefore, the tasks of determining the main routes of vehicles and constructing circular
routes of internal vehicles are considered independently of each other.
In the internal service area of the trunk nodes, the problem arises of constructing
rational circular routes of vehicles with a central main hub. Fig. 2 illustrates fragments
of the intra-node network, schematically shows the circulating flows and an example of
circular routes, where: a) an intra-node network with a central trunk node and a depot,
— locations of customers, — road junctions, road sections are shown by lines;
b) incoming and outgoing trunk flows (wide arrow), and intra-nodal flows to and from
clients (simple arrow); c) two circular routes of vehicles.
In [37, 38] for the transportation of goods in the internal network, mathematical
formulation of the problems of constructing separate routes of delivery and collection of
goods, combined routes, when simultaneous delivery and collection of goods is allowed
in internal hubs, and separate routes of delivery and collection of goods, are proposed.
For split routes, the attraction is that customer requests may exceed the carrying capaci-
ty of the vehicles, and if the magnitude of the flows fluctuates at certain intervals, you
do not have to buy or rent additional vehicles.
a b c
Fig. 2
Міжнародний науково-технічний журнал
Проблеми керування та інформатики, 2025, № 2 29
Correspondence sorting technology,
container transport vehicles, container terminal
For sorting correspondence, it is necessary to use high-performance flow sys-
tems for automated processing of discrete cargo (SAPDC), the scheme of which is
illustrated in Fig. 3. The incoming flow of correspondence from the common sto-
rage device (or accumulators) goes to the sorting lines. The number of such lines is
regulated depending on the total volume of correspondence received daily for sor -
ting. The incoming flow includes outgoing, incoming and transit correspondence
and is processed as they arrive in a continuous mode or with previous accumulation,
depending on the intensity of the flow. A device for reading unique correspondence
indices (or their extended barcodes), located at the beginning of each line, reads the
indexes and transmits them to a computer.
Fig. 3
Extended barcode can contain data on the indices of the sender ʼs and recipi-
entʼs enterprises; codes of legal entities or individuals of senders and recipients;
the date of receipt of correspondence at the senderʼs transport company, etc. Such
extended information about each correspondence makes it possible to automatical-
ly track its progress from the sender to the recipient. Sorting tables containing
groups of indexes corresponding to each sorting direction are stored in the com-
puterʼs memory. The total number of sorting directions is determined by the sum
of trunk, zonal, and internal directions. According to the decrypted index, the cor-
respondence is sent to the desired drive. The composition of the groups of indices
corresponding to the internal and zonal directions of sorting is almost constant and
changes only when new enterprises served by this node are introduced or the ser-
vice area of the node changes. The number and composition of sorting directions
for trunk node are determined after solving the problem of packaging and forming
the flows of transport blocks [5].
For data networks, the role of a sorting machine is performed by multiplexers that
combine correspondence flows into virtual containers (transport blocks).
Node types and service areas can be defined by the network designer or de-
fined in an automated mode. In any case, the problem of choosing the optimal struc-
ture of the network is solved according to the criterion of the minimum reduced
costs for its functioning and the composition and number of nodes of each type are
•••
Accumulators
of internal sorting
directions
Accumulators
of zonal sorting
directions
Accumulators
of trunk sorting
directions
Accumulator lines
Shared
storage
Computer
Input
flow
Devices for reading cargo
indices (barcodes)
••• •••
•••
•••
•••
•••
•••
•••
•
•
•
S
o
rt
in
g
l
in
es
30 ISSN 2786-6491
established. A more detailed description of the principles and technology of pro-
cessing and distribution of flows in a hierarchical network can be found in the
works [39].
In the nodes of the first type, it is planned to install domestic or imported flow
sorting systems. In other trunk nodes, it is possible to install less productive, but
cheaper systems. At the stage of pilot implementation, in the absence of expensive
equipment, handheld barcode scanners can be used to sort correspondence at the
sortersʼ workplaces.
Transportation of discrete correspondence (cargo) in containers requires the deve-
lopment and domestic industrial production (or purchase from other countries) of mo-
dern containers, forklifts and vehicles for the transportation of containers, equipped with
means of full mechanization and automation of container loading and unloading pro-
cesses. In addition, the main hubs require the construction and equipment of container
terminals capable of providing the necessary production capacity for handling incom-
ing, outgoing and transit containers.
Thus, it is obvious that container cargo handling technology requires very signifi-
cant capital expenditures and must be implemented in stages, taking into account the in-
vestments allocated annually.
Conclusion
The methodological bases for building a distributed hierarchical multicommodity
communication network with discrete correspondence flows are presented. The basic
principles and technology of organization of sorting and transportation of flows in the
zonal-nodal structure of the network are defined. In contrast to the existing approaches,
the proposed methodology is based on a comprehensive solution of the problems of
long-term, current and operational planning and management and allows to logically
link the processes of processing flows in network nodes with their subsequent distribu-
tion to networks.
В.О. Васянін, О.М. Трофимчук
КОНЦЕПТУАЛЬНІ ОСНОВИ УПРАВЛІННЯ
ОБРОБКОЮ ТА РОЗПОДІЛОМ ДИСКРЕТНИХ
ПОТОКІВ У БАГАТОПРОДУКТОВІЙ
КОМУНІКАЦІЙНІЙ МЕРЕЖІ.
Частина 1. ІЄРАРХІЧНА СТРУКТУРА
МЕРЕЖІ ТА ПРИНЦИПИ СОРТУВАННЯ
І РОЗПОДІЛУ ПОТОКІВ
Васянін Володимир Олександрович
Інститут телекомунікацій і глобального інформаційного простору НАН України,
м. Київ,
archukr@meta.ua
Трофимчук Олександр Миколайович
Інститут телекомунікацій і глобального інформаційного простору НАН України,
м. Київ,
itgis@nas.gov.ua
Міжнародний науково-технічний журнал
Проблеми керування та інформатики, 2025, № 2 31
У статті розглянуто методологічні підходи до побудови багатопродук-
тових ієрархічних комунікаційних мереж та визначені основні задачі
обробки і розподілу дискретних потоків кореспонденцій, що створю-
ють сприятливі умови для скорочення матеріальних, фінансових і тру-
дових витрат в транспортних системах при подальшій механізації та
автоматизації виробництва. Багатопродуктовим комунікаційним мере-
жам властива наявність множини джерел і стоків потоків кореспонден-
цій (продуктів або вимог). Під кореспонденцією розуміється пара різ-
них вузлів мережі, між якими є спрямований (адресний) дискретний
потік елементів (наприклад, неділимих вантажів уніфікованого розмі-
ру, бітів або символів) заданої величини. У багатопродуктовій мережі
всі потоки кореспонденцій підлягають одноразовій передачі з джерел у
стоки. Загалом на мережі може бути задана деяка множина видів (ка-
тегорій) кореспонденцій, що розрізняються вагою, габаритами й ін-
шими характеристиками, але мають загальні джерела і стоки. Приве-
дено ієрархічну структуру мережі та принципи сортування, розподілу і
маршрутизації потоків.
Ключові слова: ієрархічні багатопродуктові комунікаційні мережі,
дискретні потоки кореспонденцій, принципи і технологія обробки та
транспортування потоків у зонально-вузловій структурі мережі, задачі
довгострокового і поточного планування та оперативного керування,
інформаційно-аналітична система підтримки прийняття рішень.
REFERENCES
1. The freight story: a national perspective on enhancing freight transportation. Federal Highway
Administration. Freight Management and Operations. 2008. DOI: http://ops.fhwa.dot.gov/freight/
freight_analysis/freight_story/
2. US international trade and freight transportation trends. United States Department of Transporta-
tion: Bureau of Transportation Statistics. 2003. http://www.bts.gov
3. Trofymchuk O.M., Vasyanin V.A. Simulation of packing, distribution and routing of small-size
discrete flows in a multicommodity network. Journal of Automation and Information Sciences.
2015. Vol. 47, N 7. P. 15–30. DOI: https://doi.org/10.1615/JAutomatInfScien.v47.i7.30
4. Trofymchuk O.M., Vasyanin V.A., Kuzmenko V.N. Complexity of one packing optimization
problem. Cybernetics and Systems Analysis. 2016. Vol. 52, N 1. P. 76–84. DOI: https://doi.
org/10.1007/s10559-016-9802-9
5. Trofymchuk O.M., Vasyanin V.A., Kuzmenko V.N. Optimization algorithms for packing of
small-lot correspondence in communication networks. Cybernetics and Systems Analysis. 2016.
Vol. 52, N 2. P. 258–268. DOI: https://doi.org/10.1007/s10559-016-9822-5
6. Vasyanin V.A. Reference matrix of flow merge in package optimization problems on multiprod-
uct networks. Systematic Support and Information Technologies. 2014. N 3. P. 42–49 (in russian).
DOI: http://dspace.nbuv.gov.ua/handle/123456789/85552
7. Certificate of copyright registration for the work «Computer program for optimizing the hierar-
chical structure of a multi-product communication network with discrete flows» / applicant and
owner O.M. Trofymchuk, V.O. Vasyanin, L.P. Ushakova; A. S. dated 20.07.2016. N 66791, State
Intellectual Property Service of Ukraine; application dated 25.05.2016. N 67221 on registration of
copyright for the work.
8. Trofimchuk A.N., Vasyanin V.A. A computer simulation of the hierarchical structure communi-
cation network with the discrete multicommodity flows. Control Systems and Computers. 2016.
N 2. P. 48–57 (in russian). DOI: https://doi.org/10.15407/usim.2016.02.048
9. Vasyanin V.A., Ushakova L.P. Balancing the matrix of container flows in the problem of small-lot car-
go transportation. Ecological Safety and Environmental Protection: Sciences. Prats. 2015. N 17.
P. 98–115 (in russian). http://nbuv.gov.ua/UJRN/ebpk_2015_1_13
10. Trofimchuk A.N., Vasyanin V.A., Ushakova L.P. Study of the problem of optimizing the hierar-
chical structure of a sparse and dense communication network. International Scientific Technical
Journal Problems of Control and Informatics. 2021. N 1. P. 5–21 (in russian). DOI: https://
doi.org/10.34229/0572-2691-2021-1-1; http://nbuv.gov.ua/UJRN/PUI_2021_1_3
11. Vasyanin V.A. Problem of distribution and routing of transport blocks with mixed attachments
and its decomposition. Journal of Automation and Information Sciences. 2015. Vol. 47, N 2.
P. 56–69. DOI: https://doi.org/10.1615/JAutomatInfScien.v47.i2.60
http://ops.fhwa.dot.gov/freight/freight_analysis/freight_story/
http://ops.fhwa.dot.gov/freight/freight_analysis/freight_story/
http://www.bts.gov/
https://doi.org/10.1615/JAutomatInfScien.v47.i7.30
https://doi.org/10.1007/s10559-016-9822-5
http://dspace.nbuv.gov.ua/handle/123456789/85552
https://doi.org/10.15407/usim.2016.02.048
http://nbuv.gov.ua/UJRN/ebpk_2015_1_13
http://nbuv.gov.ua/UJRN/PUI_2021_1_3
https://doi.org/10.1615/JAutomatInfScien.v47.i2.60
32 ISSN 2786-6491
12. Vasyanin V.A. Computer modeling of distribution and routing of discrete multicommodity flows
in a communication network. Computer simulation of the distribution and discrete multicom-
modity flows routing in a communication network. Control Systems and Computers. 2016. N. 3.
P. 43–53 (in russian). DOI: https://doi.org/10.15407/usim.2016.03.043
13. Certificate of copyright registration for the work «Computer program for optimization of distribu-
tion and routing of discrete flows in a multi-product communication network» / applicant and
owner V.O. Vasyanin; A. S. dated 20.07.2016. N 66794, State Intellectual Property Service of
Ukraine; application dated 25.05.2016. N 67224 on registration of copyright for the work.
14. Vasyanin V.A. A two-criterion lexicographic algorithm for finding all shortest paths in networks.
Cybernetics and Systems Analysis. 2014. Vol. 50, N 5. P. 759–767. DOI: https://doi.org/10.1007/
s10559-014-9666-9
15. Trofimchuk A.N., Vasyanin V.A. Operation time of the Kraskal algorithm with a tree and list
structure of data. Systematic Support and Information Technologies. 2015. N 3. P. 48–61 (in russian).
http://dspace.nbuv.gov.ua/bitstream/handle/123456789/123488/05-Trofimchuk.pdf?sequence=1
16. Trofymchuk O.M., Vasyanin V.A. Choosing the capacity of arcs with constraint on flow delay
time. Cybernetics and Systems Analysis. 2019. Vol. 55, N 4. P. 561–569. DOI: https://doi.
org/10.1007/s10559-019-00165-09
17. Vasyanin V.A., Trofymchuk O.M., Ushakova L.P. Problem of groupage Cargo routing in
the multicommodity transport network with given tariffs and delivery time constraints. Cy-
bernetics and Systems Analysis. 2022. Vol. 58, N 6. P. 966–976. DOI: https://doi.org/10.1007/
s10559-023-00531-z; https://rdcu.be/c2Vh9
18. On the use of gray codes for solving 0-1 combinatorial problems of optimization in environmental
and economic systems / O. Trofymchuk, V. Vasyanin, V. Sokolov, A. Chikrii, L. Ushakova. Cy-
bernetics and Computer Technologies. 2022. N 4. P. 15–32. DOI: https://doi.org/10.34229/2707-
451X.22.4.2
19. Vasyanin V., Trofymchuk O., Ushakova L. Exact and approximate solution problem of managing
the reserve of capacity of arcs a communication network. 2023 5th International Conference on
Problems of Cybernetics and Informatics (PCI), Azerbaijan, Baku, 2023. P. 1–5. Publisher :
IEEE. https://ieeexplore.ieee.org/document/10325953
20. Nagy G., Salhi S. Location-routing: issues, models and methods. European Journal of Opera-
tional Research. 2007. Vol. 177, N 2. P. 649–672. DOI: https://doi.org/10.1016/j.ejor.2006.
04.004
21. Prodhon C., Prins C. A survey of recent research on location-routing problems. European Journal
of Operational Research. 2014. Vol. 238, N 1. P. 1–17. DOI: https://doi.org/10.1016/j.ejor.
2014.01.005
22. Cuda R., Guastaroba G., Speranza M.G. A survey on two-echelon routing problems. Computers
& Operations Research. 2015. Vol. 55. P. 185–199. DOI: https://doi.org/10.1016/j.cor.2014.06.
008
23. Drexl M., Schneider M. A survey of variants and extensions of the location-routing problem. Eu-
ropean Journal of Operational Research. 2015. Vol. 241, N 2. P. 283–308. DOI: https://doi.
org/10.1016/j.ejor.2014.08.030
24. Guastaroba G., Speranza M.G., Vigo D. Intermediate facilities in freight transportation planning:
a survey. Transportation Science. 2016. Vol. 50, N 3. P. 763–789. DOI: https://doi.org/
10.1287/trsc.2015.0631
25. Schneider M., Drexl M. A survey of the standard location-routing problem. Annals of Operations
Research. 2017. Vol. 259, N 1–2. P. 389–414. DOI: https://doi.org/10.1007/s10479-017-2509-0
26. A two-echelon location-routing problem with synchronization / S. Mirhedayatian, T. Crainic,
M. Guajardo, S. Wallace. Journal of the Operational Research Society. 2019. Vol. 72, N 1.
P. 145–160. DOI: https://doi.org/10.1080/01605682.2019.1650625
27. Rodrigue J.-P. The distribution network of amazon and the footprint of freight digitalization.
Journal of Transport Geography. 2020. Vol. 88. 102825. DOI: https://doi.org/10.1016/j.jtrangeo.
2020.102825
28. Mara S.T.W., Kuo R., Asih A.M.S. Location-routing problem: a classification of recent research.
International Transactions in Operational Research. 2021. Vol. 28, N 6. P. 2941–2983. DOI:
https://doi.org/10.1111/itor.12950
29. Two-echelon vehicle routing problems: A literature review / N. Sluijk, A.M. Florio, J. Kinable,
N. Dellaert, T.V. Woensel. European Journal of Operational Research . 2022. Vol. 304, N 3.
P. 865–886. DOI: https://doi.org/10.1016/j.ejor.2022.02.022
https://doi.org/10.15407/usim.2016.03.043
https://doi.org/10.1007/s10559-014-9666-9
https://doi.org/10.1007/s10559-014-9666-9
http://dspace.nbuv.gov.ua/bitstream/handle/123456789/123488/05-Trofimchuk.pdf?sequence=1
https://doi.org/10.1007/s10559-023-00531-z
https://doi.org/10.1007/s10559-023-00531-z
https://rdcu.be/c2Vh9
https://doi.org/10.34229/2707-451X.22.4.2
https://doi.org/10.34229/2707-451X.22.4.2
https://ieeexplore.ieee.org/document/10325953
https://doi.org/10.1016/j.ejor.2006.04.004
https://doi.org/10.1016/j.ejor.2006.04.004
https://doi.org/10.1016/j.ejor.2014.01.005
https://doi.org/10.1016/j.ejor.2014.01.005
https://doi.org/10.1016/j.cor.2014.06.008
https://doi.org/10.1016/j.cor.2014.06.008
https://doi.org/10.1287/trsc.2015.0631
https://doi.org/10.1287/trsc.2015.0631
https://doi.org/10.1007/s10479-017-2509-0
https://doi.org/10.1080/01605682.2019.1650625
https://doi.org/10.1016/j.jtrangeo.2020.102825
https://doi.org/10.1016/j.jtrangeo.2020.102825
https://doi.org/10.1111/itor.12950
https://doi.org/10.1016/j.ejor.2022.02.022
Міжнародний науково-технічний журнал
Проблеми керування та інформатики, 2025, № 2 33
30. A heuristic algorithm for a multiproduct four-layer capacitated location-routing problem /
M. Hamidi, K. Farahmand, S. Sajjadi, K. Nygard. International Journal of Industrial Engineering
Computations. 2014. Vol. 5. P. 87–100. DOI: https://doi.org/10.5267/j.ijiec.2013.09.008
31. Janjevic M., Winkenbach M., Merchan D. Integrating collection-and-delivery points in the strate-
gic design of urban last-mile e-commerce distribution networks. Transportation Research. Part E.
2019. Vol. 131. P. 37–67. DOI: https://doi.org/10.1016/j.tre.2019.09.001
32. Multicommodity location-routing: flow intercepting formulation and branch-and-cut algorithm /
M. Boccia, T. Crainic, A. Sforza, C. Sterle. Computers and Operations Research. 2018. Vol. 89.
P. 94–112. DOI: https://doi.org/10.1016/j.cor.2017.08.013
33. Ahmed S. A three echelon location routing problem with multiple commodities and courier deliv-
ery. A Thesis in The Department of Mechanical and Industrial Engineering Presented in Partial
Fulfillment of the Requirements for the Degree of Master of Applied Science (Industrial Engi-
neering) at Concordia University Montr´eal. Canada, Qu´ebec, September 2021. https://spectrum.
library.concordia.ca/id/eprint/988883/1/Ahmed_MASc_S2021.pdf
34. A multicommodity two-echelon capacitated vehicle routing problem with time windows: model
formulations and solution approach / N. Dellaert, T.V. Woensel, T.G. Crainic, F.D. Saridarq.
Computers & Operations Research. 2021. Vol. 127. 105154. DOI: https://doi.org/10.1016/
j.cor.2020.105154
35. A sequential approach for a multicommodity two-echelon distribution problem / W. Gu,
C. Archetti, D. Cattaruzza, M. Ogier, F. Semet, M. Speranza. Computers & Industrial Enginee-
ring. 2021. 37 p. https://hal.archives-ouvertes.fr/hal-03167379
36. An adaptive large neighborhood search heuristic for multicommodity two-echelon vehicle routing
problem with satellite synchronization / S. Jia, L. Deng, Q. Zhao, Y. Chen Journal of Industrial
and Management Optimization (JIMO). 2021. Vol. 19, N 2. P. 1187–1210. DOI: https://doi.org/
10.3934/jimo.2021225
37. Vasyanin V.A., Trofymchuk O.M., Ushakova L.P. Problem of building ring routes of vehicles in
a multi-product hierarchical network. International Scientific Technical Journal Problems of
Control and Informatics. 2022. Vol. 67, N 3. P. 37–55 (in Ukranian). https://journals.
indexcopernicus.com/search/article?articleId=3664741
38. Vasyanin V., Ushakova L. Mathematical models of the problem of constructing delivery
routes of Cargo in the internal zones of trunk nodes of a hierarchical transport network . Cy-
bernetics and Computer Technologies. 2024. Vol. 2. P. 15–32. DOI: https://doi.org/10.
34229/2707-451X.22.4.2
39. Vasyanin V.A. Methodology for designing multicommodity communication networks with dis-
crete flows, doctoral thesis. Kyiv, 2017 (in russian). https://itgip.org/wp-content/uploads/2017/
03/dis_Vas.pdf
Submitted 16.01.2025
https://doi.org/10.5267/j.ijiec.2013.09.008
https://doi.org/10.1016/j.tre.2019.09.001
https://doi.org/10.1016/j.cor.2017.08.013
https://doi.org/10.1016/j.cor.2020.105154
https://doi.org/10.1016/j.cor.2020.105154
https://hal.archives-ouvertes.fr/hal-03167379
https://doi.org/10.3934/jimo.2021225
https://doi.org/10.3934/jimo.2021225
https://doi.org/10.%0b34229/2707-451X.22.4.2
https://doi.org/10.%0b34229/2707-451X.22.4.2
https://itgip.org/wp-content/uploads/2017/%0b03/dis_Vas.pdf
https://itgip.org/wp-content/uploads/2017/%0b03/dis_Vas.pdf
|
| id | nasplib_isofts_kiev_ua-123456789-211370 |
| institution | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| issn | 0572-2691 |
| language | English |
| last_indexed | 2026-03-13T19:25:56Z |
| publishDate | 2025 |
| publisher | Інститут кібернетики ім. В.М. Глушкова НАН України |
| record_format | dspace |
| spelling | Vasyanin, V. Trofymchuk, O. 2025-12-31T09:51:09Z 2025 Conceptual bases for managing the processing and distribution of discrete flows in a multicommodity communication network. Part I. Hierarchical structure of the network and principles of sorting and distribution of flows / V. Vasyanin, O. Trofymchuk // Проблемы управления и информатики. — 2025. — № 2. — С. 22-33. — Бібліогр.: 39 назв. — англ. 0572-2691 https://nasplib.isofts.kiev.ua/handle/123456789/211370 519.854.2 10.34229/1028-0979-2025-2-2 The article discusses methodological approaches to the construction of multicommodity hierarchical communication networks and identifies the main tasks of processing and distribution of discrete correspondence flows, which allow to create favorable conditions for reducing material, financial and labor costs in transport systems with further mechanization and automation of production. У статті розглянуто методологічні підходи до побудови багатопродуктових ієрархічних комунікаційних мереж та визначені основні задачі обробки і розподілу дискретних потоків кореспонденцій, що створюють сприятливі умови для скорочення матеріальних, фінансових і трудових витрат в транспортних системах при подальшій механізації та автоматизації виробництва. en Інститут кібернетики ім. В.М. Глушкова НАН України Проблеми керування та інформатики Методи оптимізації та оптимальне керування Conceptual bases for managing the processing and distribution of discrete flows in a multicommodity communication network. Part I. Hierarchical structure of the network and principles of sorting and distribution of flows Концептуальні основи управління обробкою та розподілом дискретних потоків у багатопродуктовій комунікаційній мережі. Частина 1. Ієрархічна структура мережі та принципи сортування і розподілу потоків Article published earlier |
| spellingShingle | Conceptual bases for managing the processing and distribution of discrete flows in a multicommodity communication network. Part I. Hierarchical structure of the network and principles of sorting and distribution of flows Vasyanin, V. Trofymchuk, O. Методи оптимізації та оптимальне керування |
| title | Conceptual bases for managing the processing and distribution of discrete flows in a multicommodity communication network. Part I. Hierarchical structure of the network and principles of sorting and distribution of flows |
| title_alt | Концептуальні основи управління обробкою та розподілом дискретних потоків у багатопродуктовій комунікаційній мережі. Частина 1. Ієрархічна структура мережі та принципи сортування і розподілу потоків |
| title_full | Conceptual bases for managing the processing and distribution of discrete flows in a multicommodity communication network. Part I. Hierarchical structure of the network and principles of sorting and distribution of flows |
| title_fullStr | Conceptual bases for managing the processing and distribution of discrete flows in a multicommodity communication network. Part I. Hierarchical structure of the network and principles of sorting and distribution of flows |
| title_full_unstemmed | Conceptual bases for managing the processing and distribution of discrete flows in a multicommodity communication network. Part I. Hierarchical structure of the network and principles of sorting and distribution of flows |
| title_short | Conceptual bases for managing the processing and distribution of discrete flows in a multicommodity communication network. Part I. Hierarchical structure of the network and principles of sorting and distribution of flows |
| title_sort | conceptual bases for managing the processing and distribution of discrete flows in a multicommodity communication network. part i. hierarchical structure of the network and principles of sorting and distribution of flows |
| topic | Методи оптимізації та оптимальне керування |
| topic_facet | Методи оптимізації та оптимальне керування |
| url | https://nasplib.isofts.kiev.ua/handle/123456789/211370 |
| work_keys_str_mv | AT vasyaninv conceptualbasesformanagingtheprocessinganddistributionofdiscreteflowsinamulticommoditycommunicationnetworkpartihierarchicalstructureofthenetworkandprinciplesofsortinganddistributionofflows AT trofymchuko conceptualbasesformanagingtheprocessinganddistributionofdiscreteflowsinamulticommoditycommunicationnetworkpartihierarchicalstructureofthenetworkandprinciplesofsortinganddistributionofflows AT vasyaninv konceptualʹníosnoviupravlínnâobrobkoûtarozpodílomdiskretnihpotokívubagatoproduktovíikomuníkacíiníimerežíčastina1íêrarhíčnastrukturamerežítaprincipisortuvannâírozpodílupotokív AT trofymchuko konceptualʹníosnoviupravlínnâobrobkoûtarozpodílomdiskretnihpotokívubagatoproduktovíikomuníkacíiníimerežíčastina1íêrarhíčnastrukturamerežítaprincipisortuvannâírozpodílupotokív |