Алгоритмы оптимизации упаковок мелкопартионных корреспонденций в коммуникационных сетях / Трофимчук А. Н., Васянин В. А., Кузьменко В. Н. (2016)
Ukrainian

English  Cybernetics and Systems Analysis   /     Issue (2016, 52 (2))

Trofymchuk O.M., Vasyanin V.A., Kuzmenko V.N.
The optimization algorithms for packing of small-lot correspondence in communication networks

The paper discusses algorithms to solve packing optimization problem, which arises in sorting and packing of small-lot cargo in containers in mainline transportation networks or in merging messages into virtual containers in backbone data transmission networks. A problem statement is proposed and its specific properties and approaches to the solution are discussed. 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%. © 2016, Springer Science+Business Media New York.

Keywords: backbone communication networks, convergence and time complexity of algorithms, heuristic algorithms, packing optimization, small-lot flows of correspondence, Complex networks, Computational complexity, Containers, Optimization, Comparative efficiencies, Numerical experiments, Optimization algorithms, Optimization strategy, Packing optimization, small-lot flows of correspondence, Time complexity, Transportation network, Heuristic algorithms


Cite:
Trofymchuk O.M., Vasyanin V.A., Kuzmenko V.N. (2016). The optimization algorithms for packing of small-lot correspondence in communication networks. Cybernetics and Systems Analysis, 52 (2), 93-106. doi: https://doi.org/10.1007/s10559-016-9822-5 http://jnas.nbuv.gov.ua/article/UJRN-0000496951 [In Russian].


 

Інститут інформаційних технологій НБУВ


+38 (044) 525-36-24
Голосіївський просп., 3, к. 209
м. Київ, 03039, Україна