Library · IAA RAS

Papers

Algorithmic Support of Optimal Routing

Transactions of IAA RAS, issue 23, 393–395 (2012)

Keywords: transport, road element, coordinate information, objective function, optimal route, multi-step prediction, directed graph, tvertices of the graph

About the paper

Abstract

In this paper the algorithm for finding ways to directed graph, taking into account the availability of the coordinates of the vertices of the graph, inherited from the model of the transport system is proposed. Under certain restrictions on the type of objective function, the proposed algorithm is more efficient than traditionally used algorithm E. Dijkstra

Citation

Text

BibTeX

RIS

V. G. Stempkovsky . Algorithmic Support of Optimal Routing // Transactions of IAA RAS. — 2012. — Issue 23. — P. 393–395.

@article{stempkovsky2012,
  abstract = {In this paper the algorithm for finding ways to directed graph, taking into account the availability of the coordinates of the vertices of the graph, inherited from the model of the transport system is proposed. Under certain restrictions on the type of objective function, the proposed algorithm is more efficient than traditionally used algorithm E. Dijkstra},
  author = {V.~G. Stempkovsky},
  issue = {23},
  journal = {Transactions of IAA RAS},
  keyword = {transport, road element, coordinate information, objective function, optimal route, multi-step prediction, directed graph, tvertices of the graph},
  pages = {393--395},
  title = {Algorithmic Support of Optimal Routing},
  url = {http://iaaras.ru/en/library/paper/811/},
  year = {2012}
}

TY  - JOUR
TI  - Algorithmic Support of Optimal Routing
AU  - Stempkovsky, V. G.
PY  - 2012
T2  - Transactions of IAA RAS
IS  - 23
SP  - 393
AB  - In this paper the algorithm for finding ways to directed graph,
taking into account the availability of the coordinates of the
vertices of the graph, inherited from the model of the transport
system is proposed. Under certain restrictions on the type of
objective function, the proposed algorithm is more efficient than
traditionally used algorithm E. Dijkstra
UR  - http://iaaras.ru/en/library/paper/811/
ER  -