Optimization of operating costs at the planning of routes in large- scale transport networks

Abstract

Purpose: the authors develop an effective algorithm for the route planning task in a large-scale transport network, which optimizes operating costs. Discussion: the authors use the prefractal graphs as a network model of a large-scale transport network in this work. The authors constructed a mathematical model in the graph-theoretic formulation of the problem under study, taking into account the multicriteria approach. The mathematical model reduces to the problem of covering the prefractal graph by simple intersecting chains. The authors constructed and justified an algorithm that optimizes passenger and administrative costs in the operation of the transport system, called operational costs. results: the presented algorithm has several times less computational complexity in comparison with the classical approach when solving this problem using graphs. The authors justified the optimality of the found solution based on the selected criterion and gave the estimates for the remaining criteria.