CLOUD CONTROL OF TRANSPORT: SELECTION OF AN OPTIMAL ROUTE

Abstract

The algorithm for designing the optimal route on the road infrastructure between two co- ordinates is considered which are identified with the departure and arrival points. The possible restrictions are connected with road collisions, accidents and road repairs which should also be considered at selecting the optimal route. It is assumed that the algorithm implementation will be introduced as an on-line cloud service for vehicle drivers in the frames of creating a cyber- physical system of intellectual cloud control of traffic. A criterion for the topology quality, taking into account the sums of all distances between each pair of components or the nodes of the corresponding graph reduced to the number of sides is proposed. The following tasks are set and solved: 1) determining all the shortest ways and the corresponding distances from a fixed node v to the other nodes of the infrastructure; 2) finding the shortest distances between all the pairs of the nodes for a graph with single weight coefficients of the set by the matrix contiguity; 3) finding the shortest distances between all the node pairs and estimate the infra- structures in accordance with the developed quality criteria for different types of graphs of the set by the matrices contiguity; 4) comparing different architectures and graph structures for the purpose of determining efficient solutions to reduce the time of movement along the ordered route. As a result of investigations carried out, a step-by-step synthesis of the proposed method for designing an optimal route of a vehicle movement is carried out. The simplified criteria for the quality topologies show that the road infrastructure designed on triangular connections of the departure and arrival points is twice as efficient as the generally accepted topology “Man- hattan”.