Development of the Algorithm for Finding the Optimal Path in a Transport Network with Dynamic Parameters based on the Multidimensional Data Model

被引：0

作者：

Sokolov, Alexsey ^{[1
]}

Bakulev, Alexander ^{[1
]}

Fetisova, Tatyana ^{[1
]}

Bakuleva, Marina ^{[1
]}

机构：

[1] RSREU, Fac Comp Sci, Ryazan, Russia

来源：

2019 8TH MEDITERRANEAN CONFERENCE ON EMBEDDED COMPUTING (MECO) | 2019年

关键词：

transport network; transport network loading; transport network loading models; throughput; graphs; algorithms on graphs; the shortest path; Floyd-Warshall algorithm; multidimensional model;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper presents the approach to finding the optimal path for the number of criteria in the transport network. The aim of the work is the development of the algorithm for finding the optimal path capable of solving this problem in the conditions of constantly changing external factors. As such factors, the most common metrics are chosen - travel time and throughput. As a mathematical model reflecting the dynamics of external factors, the tensor model is used. It is based on the dynamic Floyd - Warshall algorithm for finding the shortest distances between all the vertices of a weighted oriented graph. The developed algorithm is modified for the iterative analysis of paths in the graph and finding the optimal one with constant changes in throughput.

引用

页码：262 / 265

页数：4