UDC 519.854.2: 004.023

The optimization algorithms for packing of small-lot correspondence in communication networks

The paper discusses algorithms to solve optimization packing problem, which arises in sorting and packing of small-lot cargo in containers in mainline transport networks or in merge of messages into virtual containers in backbone data transmission networks. A problem statement is proposed and its specific properties and approaches to the solution are discusses. The convergence and time complexity of the number of heuristic algorithms are analyzed and numerical experiments are used to investigate their comparative efficiency. It is shown experimentally that solutions results obtained by different optimization strategies based on networks that have up to 500 nodes differ by no more than 2.65%. Tabl.: 2. Refs: 7 titles.

Keywords:

backbone communication networks, small-lot flows of correspondence, packing optimization, heuristic algorithms, convergence and time complexity of algorithms.


FULL TEXT

About author(s):

Трофимчук Александр Николаевич, чл.-кор. НАН Украины, доктор техн. наук, профессор, заместитель директора Института телекоммуникаций и глобального информационного пространства НАН Украины, Киев,
e-mail: itelua@kv.ukrtel.net

Васянин Владимир Александрович, кандидат техн. наук, старший научный сотрудник Института телекоммуникаций и глобального информационного пространства НАН Украины, Киев,
e-mail: archukr@meta.ua

Кузьменко Виктор Николаевич, кандидат физ.-мат. наук, старший научный сотрудник Института кибернетики им. В.М. Глушкова НАН Украины, Киев,
e-mail: kvnu@mail.ru