Suscripción a Biblioteca: Guest
Journal of Automation and Information Sciences

Publicado 12 números por año

ISSN Imprimir: 1064-2315

ISSN En Línea: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

Problem of Distribution and Routing of Transport Blocks with Mixed Attachments and Its Decomposition

Volumen 47, Edición 2, 2015, pp. 56-69
DOI: 10.1615/JAutomatInfScien.v47.i2.60
Get accessGet access

SINOPSIS

Consideration is given to the mathematical model of the nonlinear multiextreme discrete problem of distribution and routing in the multicommodity network of transport blocks with nested small packages flows of cargoes or messages with different addresses of destination. The special features of its solution for a transport network and data transmission network for nonramified and ramified flows at restrictions on a time of delivery of small packages flows to a recipient and the average time of a delay of flows are discussed. The method of reducing the solution of the original problem to solution of some set of linear multidimensional knapsack problems with binding restrictions is offered. Results of numerical modeling of the solution of a problem on the example of a transport network are given.

CITADO POR
  1. Trofymchuk O. M., Vasyanin V. A., Kuzmenko V. N., Optimization Algorithms for Packing of Small-Lot Correspondence in Communication Networks, Cybernetics and Systems Analysis, 52, 2, 2016. Crossref

Portal Digitalde Biblioteca Digital eLibros Revistas Referencias y Libros de Ponencias Colecciones Precios y Políticas de Suscripcione Begell House Contáctenos Language English 中文 Русский Português German French Spain