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%.
Keywordsbackbone communication networks small-lot flows of correspondence packing optimization heuristic algorithms convergence and time complexity of algorithms
Unable to display preview. Download preview PDF.
- 2.A. N. Trofimchuk and V. A. Vasyanin, “Simulation of packing, distribution, and routing of small-size discrete flows in a multicommodity network,” J. Autom. Inform. Sci., 47, No. 4. 15–30 (2015).Google Scholar
- 3.V. A. Vasyanin, “Reference matrix of flow merging in packing optimization problems on multicommodity networks,” “Syst. Doslidzh. ta Inform. Tekhnologii, No. 3, 42–49 (2014).Google Scholar
- 6.I. V. Sergienko, Mathematical Models and Methods to Solve Discrete Optimization Problems [in Russian], Naukova Dumka, Kyiv (1988).Google Scholar
- 7.V. A. Vasyanin, “Comparative efficiency of packing optimization algorithms in multi-flow networks,” in: Discrete Control Systems [in Russian], Inst. Cybern. NAS Ukr., Kyiv, Ukraine (1988), pp. 36–45.Google Scholar