English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

. The problems of optimal planning of multi-product flows on transportation networks have a variety of important practical applications (transportation, logistics, communication networks). The mathematical models of these problems, as a rule, are characterized by a large dimension (hundreds of thousands of variables). Due to the specific features of multi-product transportation problems (pronounced block structure), the use of standard general-purpose optimization packages for their solution is not advisable. In this work of an applied nature, we propose a method for solving one class of such problems, taking into account their specificity. The method is based on the decomposition scheme with respect to a set of binding constraints. The corresponding dual problem is the nonsmooth optimization problem. To solve it, a new version of the subgradient algorithm with space dilation of variables is used. This approach to solving block optimization problems has been tested in solving a wide class of applied problems and, as experience shows, is characterized by a fairly high efficiency.Purpose of the article to develop a solution method and software for the problem of optimal planning of multi-product flows and modernization of the transportation system.Results. A mathematical model of the problem of optimal planning multi-product flows on the transportation network is proposed. The model is based on a variant transportation realization scheme. The software is developed in the C++ language in the style of object-oriented programming. The following algorithms are used as basic elements of the software: an algorithm for finding the shortest paths on a graph, an algorithm for solving a transportation problem on a graph, nonsmooth optimization algorithm.Conclusions. The output data of the developed software determines the following information: rational transportation scheme, critical by capacity sections of the transportation network, recommendations for the rational distribution of funds for the reconstruction of the transportation network.  The software is designed to solve the problems of long-term planning of the functioning and development of the transportation system. Keywords: optimal planning, mathematical model, subgradient methods, dual problem, software.

On the Problem of Planning of Multi-Product Flows and Modernization of the Transportation Network