Automatization Search for the Shortest Routes in the Transport Network Using the Floyd-warshell Algorithm
Vladimir V. Sakharov, Sergei Chernyi, Sergey Saburov, Alexandr A. Chertkov
Abstract
The operational problem of determining the shortest routes for a group of vessels that have received the task of achieving hypothetical target with certain coordinates located in a confined space is being solved. When controlling the process of vessels entering a desired area, time is an important indicator. The practical implementation of the modified Floyd-Warshall algorithm is demonstrated by calculating a network model with a complex topology, using an iterative procedure by means of a program in MATLAB codes. The computer model implemented on its basis is simple and compact. Unlike existing models, the suggested model allows one to eliminate the restrictions associated with the presence of negative weights and cycles in the network, to automate the calculation of the shortest paths at the nodes by means of the computer technology implemented in MATLAB.