The National Transport University Bulletin

Abstract

The object of research is the processes of organization and planning of routed transportation by road transport. The purpose of the work is to substantiate the models and algorithms of transport routing, taking into account probabilistic factors. The research used a complex method of modeling, analysis and synthesis. Today, in the context of rising fuel prices and complicated logistics chains, the use of navigation technologies and computer systems is extremely important, which, using efficient routing algorithms, save fuel and facilitate the timely delivery of goods and passengers by road transport. Therefore, an important part of the software of the GPS system for monitoring routed traffic is a specialized module designed for optimal routes planning and control of the schedule of vehicles passing through control zones. An important task for the successful implementation of all functions of the routing module is the development of effective algorithms for computing optimal routes for transportation, suitable for use in real road conditions in case of accidents and congestion. However, the existing methods and algorithms for constructing and selecting the optimal routes of traffic mainly involve finding the shortest (cheapest) way of road transport without formalized taking into account the occurrence of traffic jams and turning aside the planned schedule. The article provides a formalized description of traffic flow routing models that will ensure the construction and selection of optimal routes for the probability of unconstrained passing of vehicles, as well as taking into account the shortest path between the starting and ending points. A matrix method and algorithm for finding the maximum probability of unconstrained passage are also proposed, which should be implemented within the routing software module of the automated GPS system for monitoring traffic in order to reduce operating costs and ensure in time delivery of goods and passengers.

Keywords: