Methods of organization and planning of maximum shortest routes in large-scale transport networks taking into account a multi-criteria approach

Abstract

Purpose: the authors aim to develop the efficient algorithm for the allocation of the shortest possible routes for the task of organizing and planning transportation in a large-scale transport network. Discussion: the article deals with the investigation of the methods of solving the problem related to the optimization of passenger and freight traffic in transport and logistics systems. When solving such problems, as a rule, one has to take into account the various requirements imposed on the system, which often contradict each other, which leads to the problem of choice under conditions of multi-criteria. The article proposes a mathematical model of the problem under study in a multi-criteria formulation. As a network model of the transport network, the article proposes to use prefractal graphs that have several advantages over the «classical» graphs. Prefractal graphs has the conditions that allow us to distinguish an admissible set of solutions on which a vector-objective function is built with given criteria; it optimizes the problem. The authors search for a solution to the problem with the use of specially constructed algorithms. The authors present and justify the algorithm for solving the problem. It makes it possible to optimize the criterion aimed at identifying routes covering as many transport hubs as possible on your way or identifying the shortest (by inclusion) shortest routes. The study gives the estimates for the remaining criteria. The quality of the algorithm is estimated by its computational complexity. The article presents the comparison of the reduced algorithm of «classical» graphs and prefractal graphs. Results: the authors constructed an efficient algorithm for organizing and planning of freight transportation, which gives the maximum routes for inclusion in large-scale transportation networks.