Temat: shortest route - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Bi-directional search in route planning in navigation
Autorzy:: Dramski, M.
Powiązania:: https://bibliotekanauki.pl/articles/360091.pdf
Data publikacji:: 2014
Wydawca:: Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:: shortest path
safe route
restricted area
bi-directional search
Dijkstra algorithm
Opis:: The shortest path problem is one of the most significant ones in the field of maritime navigation. One of the most efficient algorithms was proposed by E. Dijkstra in 1959. Taking into account the development of computer technology was offered another interesting approach to the issue. The main idea is to execute the shortest path algorithm simultaneously forward from the source and backward from the target. The results are presented and discussed.
Źródło:: Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2014, 39 (111); 57-62
1733-8670
2392-0378
Pojawia się w:: Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Multithreaded enhancements of the Dijkstra algorithm for route optimization in urban networks
Autorzy:: Bazan, M.
Ciskowski, P.
Dudek, R.
Halawa, K.
Janiczek, T.
Kozaczewski, P.
Rusiecki, A.
Powiązania:: https://bibliotekanauki.pl/articles/393379.pdf
Data publikacji:: 2016
Wydawca:: Polskie Stowarzyszenie Telematyki Transportu
Tematy:: Dijkstra algorithm
shortest paths
fastest routes
urban networks
route optimization
algorytm Dijkstry
najkrótsza ścieżka
najszybsza trasa
sieć miejska
optymalizacja trasy
Opis:: In this paper, we present a case study, showing step by step, how to speed up Dijkstra’s method by parallelizing its computation and using different data structures. We compare basic algorithm with its bidirectional version and investigate two-and-multi-thread implementations based on Fibonacci heaps and regular priority queues. Experimental results obtained for artificially generated graphs as well as real-world road network data are presented and described.
Źródło:: Archives of Transport System Telematics; 2016, 9, 2; 3-7
1899-8208
Pojawia się w:: Archives of Transport System Telematics
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Method of Path Selection in the Graph - Case Study
Autorzy:: Neumann, T.
Powiązania:: https://bibliotekanauki.pl/articles/116904.pdf
Data publikacji:: 2014
Wydawca:: Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:: Path Selection
Method of Path Selection
graph theory
Dijkstra algorithm
route planning
Cutting-Edge Thinking Mechanisms
New Paths Searching
shortest path
Opis:: This paper presents a different perspective on the Dijkstra algorithm. In this paper algorithm will be used in the further analysis to find additional paths between nodes in the maritime sector. In many cases, the best solution for a single criterion is not sufficient. I would be the search for more effective solutions of the starting point to use for subsequent analysis or decision making by the captain of the ship. Using cutting-edge thinking mechanisms, it is possible to create a decision support system based on known Dijkstra's algorithm.
Źródło:: TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2014, 8 no. 4; 557-562
2083-6473
2083-6481
Pojawia się w:: TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja