DocumentCode :
3701505
Title :
Optimization of the search algorithm for the shortest route
Author :
Denis A. Akmaykin;Svetlana F. Klyueva;Oleg A. Bukin;Pavel A. Salyuk
Author_Institution :
Maritime State University named after Admiral Nevelskoy, 50a, Verkhneportovaya St., Vladivostok, 690059, Russia
fYear :
2015
Firstpage :
545
Lastpage :
548
Abstract :
The exact and heuristic algorithms of search of the shortest routes on the graph are analyzed in the article. The realization of Floyd-Warshall algorithm of search for the shortest routes is shown. The description and realization of the author´s heuristic algorithm of search for the shortest route for two chosen vertexes of graph for the given heuristic estimated function is given.
Keywords :
"Heuristic algorithms","Algorithm design and analysis","Junctions","Polynomials","Optimization","Search problems","Joining processes"
Publisher :
ieee
Conference_Titel :
"Stability and Control Processes" in Memory of V.I. Zubov (SCP), 2015 International Conference
Type :
conf
DOI :
10.1109/SCP.2015.7342207
Filename :
7342207
Link To Document :
بازگشت