Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Dijkstra algorithm" wg kryterium: Wszystkie pola

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-23 z 23
    Tytuł:
    AIS based shipping routes using the dijkstra algorithm
    Autorzy:
    Silveira, P.
    Teixeira, A. P.
    Guedes-Soares, C.
    Powiązania:
    https://bibliotekanauki.pl/articles/116029.pdf
    Data publikacji:
    2019
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    Dijkstra’s Algorithm
    AIS Data
    Automatic Identification System (AIS)
    AIS based shipping routes
    shipping routes
    Vessel Traffic Service (VTS)
    port of Setubal
    Ro-Ro Terminal
    Opis:
    This paper proposes an approach for identifying and characterizing shipping routes using information contained in Automatic Identification System messages broadcasted by ships and recorded by the coastal Vessel Traffic Service centre. The approach consists of using historical Automatic Identification System data to build a graph, where nodes are cells of a grid covering the geographical area being studied and the weights of directional edges are inversely related to ship movements between cells. Based on this graph, the Dijkstra algorithm is used to identify a potential safe route, assumed to be the most used route by ships between two locations. A second graph is created simultaneously, with the same nodes and edges, but with edge weights equal to the average speed of transitions between cells, thus allowing the determination of the average speed profile for any possible path within the graph. The proposed approach is applied to two scenarios: an approach to the port of Lisbon and the entry through the fairway to a RO-RO terminal in the port of Setubal in Portugal.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2019, 13, 3; 565-571
    2083-6473
    2083-6481
    Pojawia się w:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    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ł
    Tytuł:
    A comparison between Dijkstra algorithm and simplified ant colony optimization in navigation
    Analiza porównawcza algorytmu Dijkstry i uproszczonego algorytmu mrówkowego w nawigacji
    Autorzy:
    Dramski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/360173.pdf
    Data publikacji:
    2012
    Wydawca:
    Akademia Morska w Szczecinie. Wydawnictwo AMSz
    Tematy:
    poszukiwanie najkrótszej drogi
    akwen ograniczony
    nawigacja
    shortest path routing
    restricted area
    navigation
    Opis:
    In this paper, two different shortest path routing algorithms in respect of basic navigation problems are discussed. First of them is a “state of art” in computer science – well known Dijkstra algorithm. The second one is a method based on artificial intelligence – simplified ant colony optimization proposed originally by Marco Dorigo. Author used both ways to find an optimal / suboptimal route for a ship in a restricted area. Results showed the advantages and disadvantages of both algorithms in simple static navigation situations.
    W artykule omówiono dwa różne algorytmy poszukiwania najkrótszej drogi w odniesieniu do zagadnień nawigacji. Pierwszym z nich jest algorytm Dijkstry, stanowiący podstawę rozwiązywania tego typu problemów. Drugi to metoda bazująca na sztucznej inteligencji – uproszczony algorytm mrówkowy, zaproponowany przez Marco Dorigo. Autor używał obu sposobów w celu uzyskania optymalnej, bądź suboptymalnej trasy dla statku na akwenie ograniczonym. Rezultaty badań pokazały korzyści i wady ze stosowania obu rozwiązań w prostych sytuacjach nawigacyjnych.
    Źródło:
    Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2012, 29 (101); 25-29
    1733-8670
    2392-0378
    Pojawia się w:
    Zeszyty Naukowe Akademii Morskiej w Szczecinie
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Towards use of dijkstra algorithm for optimal navigation of an unmanned surface vehicle in a real-time marine environment with results from artificial potential field
    Autorzy:
    Singh, Y.
    Sharma, S.
    Sutton, R.
    Hatton, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/116058.pdf
    Data publikacji:
    2018
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    autonomous vehicles
    dijkstra’s algorithm
    Unmanned Surface Vehicle (USV)
    port of portsmouth
    Artificial Path Planning (APF)
    Artificial Potential Field
    real-time marine environment
    optimal navigation
    Opis:
    The growing need of ocean surveying and exploration for scientific and industrial application has led to the requirement of routing strategies for ocean vehicles which are optimal in nature. Most of the op-timal path planning for marine vehicles had been conducted offline in a self-made environment. This paper takes into account a practical marine environment, i.e. Portsmouth Harbour, for finding an optimal path in terms of computational time between source and end points on a real time map for an USV. The current study makes use of a grid map generated from original and uses a Dijkstra algorithm to find the shortest path for a single USV. In order to benchmark the study, a path planning study using a well-known local path planning method artificial path planning (APF) has been conducted in a real time marine environment and effectiveness is measured in terms of path length and computational time.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2018, 12, 1; 125-131
    2083-6473
    2083-6481
    Pojawia się w:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Determination of the shortest path as the basis for examining the most weather favorable routes
    Autorzy:
    Medyna, P.
    Mąka, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/359105.pdf
    Data publikacji:
    2012
    Wydawca:
    Akademia Morska w Szczecinie. Wydawnictwo AMSz
    Tematy:
    Dijkstra's algorithm
    evolutionary algorithms
    initial population
    GFS land / ocean data
    Opis:
    Generating initial population of evolutionary algorithms used in the process of weather ship route optimization requires the determination of the area where it may find the points of designated routes. The problem may be a need to sail around the continent, circumnavigate the islands, and the restrictions from the ice fields and other closed areas. Comparing routes to the rhumb line or great circle may be also impossible. It is proposed to determinate the preliminary route using Dijkstra's algorithm using land / ocean data of the GFS model. It will be used during generation an initial population on the ocean area in these cases.
    Źródło:
    Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2012, 32 (104) z. 1; 29-33
    1733-8670
    2392-0378
    Pojawia się w:
    Zeszyty Naukowe Akademii Morskiej w Szczecinie
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    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ł
    Tytuł:
    Tractography Methods in Preoperative Neurosurgical Planning
    Autorzy:
    Koryciński, Mateusz
    Ciecierski, Konrad A.
    Powiązania:
    https://bibliotekanauki.pl/articles/1839329.pdf
    Data publikacji:
    2021
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    artificial intelligence
    diffusion tensor imaging
    Dijkstra's algorithm
    graph traversing
    MRI
    neural networks
    tractography
    Opis:
    Knowledge of the location of nerve tracts during the surgical preoperative planning stage and during the surgery itself may help neurosurgeons limit the risk of causing neurological deficits affecting the patient’s essential abilities. Development of MRI techniques has helped profoundly with in vivo visualization of the brain’s anatomy, enabling to obtain images within minutes. Different methodologies are relied upon to identify anatomical or functional details and to determine the movement of water molecules, thus allowing to track nerve fibers. However, precise determination of their location continues to be a labor-intensive task that requires the participation of highly-trained medical experts. With the development of computational methods, machine learning and artificial intelligence, many approaches have been proposed to automate and streamline that process, consequently facilitating image-based diagnostics. This paper reviews these methods focusing on their potential use in neurosurgery for better planning and intraoperative navigation.
    Źródło:
    Journal of Telecommunications and Information Technology; 2021, 3; 78-85
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Learning Search Algorithms: An Educational View
    Autorzy:
    Janota, M.
    Šimák, V.
    Hrbček, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/116502.pdf
    Data publikacji:
    2014
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    Search Algorithm
    Learning Search Algorithms
    educational view
    Artificial Intelligence Method
    Search Method
    Labyrinth
    Dijkstra algorithm
    Opis:
    Artificial intelligence methods find their practical usage in many applications including maritime industry. The paper concentrates on the methods of uninformed and informed search, potentially usable in solving of complex problems based on the state space representation. The problem of introducing the search algorithms to newcomers has its technical and psychological dimensions. The authors show how it is possible to cope with both of them through design and use of specialized authoring systems. A typical example of searching a path through the maze is used to demonstrate how to test, observe and compare properties of various search strategies. Performance of search methods is evaluated based on the common criteria.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2014, 8 no. 4; 565-570
    2083-6473
    2083-6481
    Pojawia się w:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Wyznaczanie trasy statku żaglowego z ograniczeniem zmian kursu
    Determination of the sailing vessel route with limitation of changing the course
    Autorzy:
    Życzkowski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/344241.pdf
    Data publikacji:
    2017
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydawnictwo Uniwersytetu Morskiego w Gdyni
    Tematy:
    trasa
    statki żaglowe
    algorytm Dijkstry
    dane meteorologiczne
    nawigacja
    routing
    sailing vessel
    Dijkstra algorithm
    weather data
    navigation
    Opis:
    W artykule przedstawiono propozycję rozwiązania problemu planowania trasy statku żaglowego z zadanej pozycji startowej do pozycji docelowej w przestrzeni dyskretnej. Artykuł jest kontynuacją rozważań autora nad planowaniem trasy statku żaglowego. Proponowana wersja metody jest odpowiednia dla użytkowników statków żaglowych o przeznaczeniu rekreacyjnym lub dla początkujących żeglarzy. Jako kryterium optymalizacji przyjęto czas żeglugi, ale wprowadzono ograniczenie możliwości wykonywania znacznych zmian kursu.
    The article presents a solution to the problem of planning a sailing vessel route from a given starting position to a target position in a discrete domain. This article is a continuation of the author's research on the sailing ship's route planning. The proposed version of the method is suitable for recreational sailing craft users or beginner sailors. The time of navigation was chosen as the optimization criterion, but the possibility of making significant alteration of the course was limited.
    Źródło:
    Prace Wydziału Nawigacyjnego Akademii Morskiej w Gdyni; 2017, 32; 121-132
    1730-1114
    Pojawia się w:
    Prace Wydziału Nawigacyjnego Akademii Morskiej w Gdyni
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Dijkstras algorithm revisited: the dynamic programming connexion
    Autorzy:
    Sniedovich, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/970872.pdf
    Data publikacji:
    2006
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    programowanie dynamiczne
    badania operacyjne
    Dijkstra's algorithm
    dynamic programming
    greedy algorithm
    principle of optimality
    successive approximation
    operations research
    computer science
    Opis:
    Dijkstra's Algorithm is one of the most popular algorithms in computer science. It is also popular in operations research. It is generally viewed and presented as a greedy algorithm. In this paper we attempt to change this perception by providing a dynamic programming perspective on the algorithm. In particular, we are reminded that this famous algorithm is strongly inspired by Bellman's Principle of Optimality and that both conceptually and technically it constitutes a dynamic programming successive approximation procedure par excellence. One of the immediate implications of this perspective is that this popular algorithm can be incorporated in the dynamic programming syllabus and in turn dynamic programming should be (at least) alluded to in a proper exposition/teaching of the algorithm.
    Źródło:
    Control and Cybernetics; 2006, 35, 3; 599-620
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Zastosowanie informatyki w logistyce transportu
    Application of computer science in transportation logistics
    Autorzy:
    Brzoza, A.
    Muszyński, G.
    Powiązania:
    https://bibliotekanauki.pl/articles/317223.pdf
    Data publikacji:
    2017
    Wydawca:
    Instytut Naukowo-Wydawniczy "SPATIUM"
    Tematy:
    logistyka transportu
    informatyka w logistyce
    planowanie transportu towarów
    Dijkstra
    algorytm Dijkstry
    transport logistics
    information in logistics
    freight planning
    Dijkstra's algorithm
    Opis:
    W artykule została omówiona logistyka transportu mająca coraz większe znaczenie w planowaniu transportu towarów. Ponieważ koszty transportu zależą od jego przewidywanego czasu dostarczenia oraz od środka transportu, stąd planowanie trasy przejazdu jest istotnym czynnikiem w logistyce transportu, która we współczesnym świecie nie może w pełni funkcjonować bez rozwiązań informatycznych. W artykule poddano analizie transport kolejowy w Szwajcarii, będący jednym z najbardziej rozwiniętych tego typu systemów transportowych w Europie. Obliczenia bazują na przykładowych danych dotyczących tras kolejowych narodowego przewoźnika w tym kraju z wyborem czasu przejazdu jako głównego kryterium wyznaczania optymalnej trasy przejazdu dla wybranych połączeń między miastami. Dla potrzeb analizy został stworzony program implementujący algorytm Dijkstry, który posłużył do wyszukiwania optymalnego połączenia między wskazanymi miastami według danego kryterium.
    This article discusses some computer-based logistics solutions aimed to improve the planning process in freight transport. Since transport costs are dependent on the lead time and the transport mode, route planning is a crucial factor in transport logistics, which, these days, relies heavilyon computer technology. The study is focused on the rail transport system in Switzerland, known to be the most developed in Europe. The data used in the computations refers to rail routes of the national carrier in that country. The transportation time was the main criterion to select an optimal route between origin and destination. The analysis involved developing a program that implements Dijkstra’s algorithm to find an optimal connection between places according to the selected criterion.
    Źródło:
    Autobusy : technika, eksploatacja, systemy transportowe; 2017, 18, 6; 1335-1337, CD
    1509-5878
    2450-7725
    Pojawia się w:
    Autobusy : technika, eksploatacja, systemy transportowe
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Ship route planning using historical trajectories derived from AIS Data
    Autorzy:
    He, Y. K.
    Zhang, D.
    Zhang, J. F.
    Zhang, M. Y.
    Li, T. W.
    Powiązania:
    https://bibliotekanauki.pl/articles/116536.pdf
    Data publikacji:
    2019
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    AIS Data
    Automatic Identification System (AIS)
    route planning
    historical trajectories
    AIS messages
    marine traffic
    Dijkstra algorithm
    ant colony algorithm
    Opis:
    Ship route planning is one of the key issues in enhancing traffic safety and efficiency. Many route planning methods have been developed, but most of them are based on the information from charts. This paper proposes a method to generate shipping routes based on historical ship tracks. The ship's historical route information was obtained by processing the AIS data. From which the ship turning point was extracted and clustered as nodes. The ant colony algorithm was used to generate the optimize route. The ship AIS data of the Three Gorges dam area was selected as a case study. The ships’ optimized route was generated, and further compared with the actual ship's navigation trajectory. The results indicate that there is space of improvement for some of the trajectories, especially near the turning areas.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2019, 13, 1; 69-76
    2083-6473
    2083-6481
    Pojawia się w:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Design and development of a road traffic redirection system
    Autorzy:
    Bazan, M.
    Janiczek, T.
    Halawa, K.
    Dudek, R.
    Rudawski, Ł.
    Powiązania:
    https://bibliotekanauki.pl/articles/393375.pdf
    Data publikacji:
    2017
    Wydawca:
    Polskie Stowarzyszenie Telematyki Transportu
    Tematy:
    traffic redirection
    Dijkstra algorithm
    shortest paths
    dynamic rerouting
    guidance systems
    przekierowanie ruchu
    algorytm Dijkstry
    najkrótsza ścieżka
    dynamiczna zmiana trasy
    systemy kierowania
    Opis:
    Nowadays, the crucial issue of guidance systems based on a GPS signal is that they are not able to redirect road users, taking into account the current state of traffic (and the predicted state within the time of the travel) in the city. In this paper we present a three layer architecture of a computer system capable of redirecting users of an urban road system via routes with a lighter traffic load in order to reach their declared destination in the city. A basic layer is a multiprocessor calculation server running Dijkstra path search tasks, the middle layer - the one which is visible to the road user - is a replicable proxy server that collects route requests from road users. The third layer is a mobile application. The prototype of such a system was developed by the ArsNumerica Group. The crucial feature of the system is feedback from road users that allows us to adjust the whole Intelligent Transportation System in the city to changes in traffic flow at various road links introduced by the redirection process applied to many users. The performance test strategy to prove the efficiency of the architecture was carried out for the city of Wrocław.
    Źródło:
    Archives of Transport System Telematics; 2017, 10, 1; 3-8
    1899-8208
    Pojawia się w:
    Archives of Transport System Telematics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    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ł
    Tytuł:
    Analiza i implementacja algorytmów odnajdywania ścieżki do zastosowania w grach przeglądarkowych
    Analysis and implementation of pathfinding algorithms for use in browser games
    Autorzy:
    Laszkiewicz, Beata
    Sobczak, Tomasz
    Powiązania:
    https://bibliotekanauki.pl/articles/2146697.pdf
    Data publikacji:
    2022
    Wydawca:
    Wrocławska Wyższa Szkoła Informatyki Stosowanej Horyzont
    Tematy:
    gra przeglądarkowa
    graf
    algorytm Bellmana-Forda
    algorytm Dijkstry
    algorytm A-star
    browser game
    graph
    Bellman-Ford algorithm
    Dijkstra algorithm
    A-star algorithm
    Opis:
    Celem tego artykułu jest przedstawienie, porównanie oraz implementacja algorytmów odnajdywania ścieżki do zastosowania w grach przeglądarkowych z wykorzystaniem ogólnodostępnych, darmowych technologii internetowych. Pokazano również możliwość wykorzystania najlepszego algorytmu w grze przeglądarkowej
    The goal of this article is to present, compare and implement path finding algorithms for use in browser games, using public, free internet technologies. The possibility of using the best algorithm in a browser game is also shown.
    Źródło:
    Biuletyn Naukowy Wrocławskiej Wyższej Szkoły Informatyki Stosowanej. Informatyka; 2022, 9, 1; 16--24
    2082-9892
    Pojawia się w:
    Biuletyn Naukowy Wrocławskiej Wyższej Szkoły Informatyki Stosowanej. Informatyka
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Vessels Route Planning Problem with Uncertain Data
    Autorzy:
    Neumann, T.
    Powiązania:
    https://bibliotekanauki.pl/articles/115957.pdf
    Data publikacji:
    2016
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    maritime-related data
    route planning
    dempster-shafer theory (DST)
    vessels route planning
    Dijkstra's algorithm
    decision rules
    mathematical theory of evidence
    uncertain data
    Opis:
    The purpose of this paper is to find a solution for route planning in a transport networks, where the costs of tracks, factor of safety and travel time are ambiguous. This approach is based on the Dempster-Shafer theory and well known Dijkstra's algorithm. In this approach important are the influencing factors of the mentioned coefficients using uncertain possibilities presented by probability intervals. Based on these intervals the quality intervals of each route can be determined. Applied decision rules can be described by the end user.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2016, 10, 3; 459-464
    2083-6473
    2083-6481
    Pojawia się w:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Algorytm Dijkstry w modelowaniu samochodowego ruchu miejskiego
    Dijkstras algorithm in urban traffic modelling
    Autorzy:
    Chalfen, M.
    Kamińska, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/316688.pdf
    Data publikacji:
    2013
    Wydawca:
    Instytut Naukowo-Wydawniczy "SPATIUM"
    Tematy:
    samochodowy ruch miejski
    czas przejazdu w mieście
    analiza efektywności
    algorytm Dijkstry
    car urban traffic
    travel time in the city
    analysis of efficiency
    Dijkstra algorithm
    Opis:
    W pracy przedstawiono matematyczny model ruchu samochodowego mieście w okresie porannego szczytu. Obliczenia wykonano na przykładzie hipotetycznego miasta średniej wielkości przy założeniu niejednorodności gęstości sieci ulic i zróżnicowanych rzeczywistych prędkościach poruszania się samochodów w wybranych rejonach miasta. Do określenia optymalnej trasy przejazdu pojedynczego pojazdu wykorzystano algorytm Dijkstry wyszukiwania najtańszej ścieżki w grafie. Metodami statystycznymi wykazano przydatność tego algorytmu do modelowania ruchu samochodowego.
    The paper presents a mathematical model of the traffic flow during the morning rush. The calculations were performed on the example of a hypothetical medium-sized cities, assuming a heterogeneity density of road network and diverse actual speed of movement of cars in some areas of the city. To determine the optimal route of the vehicle were used a Dijkstra algorithm to search the cheapest path in the graph. Statistical methods have shown the usefulness of this algorithm to modeling the urban traffic.
    Źródło:
    Autobusy : technika, eksploatacja, systemy transportowe; 2013, 14, 3; 1885-1893
    1509-5878
    2450-7725
    Pojawia się w:
    Autobusy : technika, eksploatacja, systemy transportowe
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The use of the roadload application in geographical studies of flows generated by individual modes of transport
    Autorzy:
    Borowska-Stefańska, Marta
    Kowalski, Micha
    Wiśniewski, Szymon
    Domagalski, Adam
    Powiązania:
    https://bibliotekanauki.pl/articles/1841142.pdf
    Data publikacji:
    2020
    Wydawca:
    Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
    Tematy:
    RoadLoad application
    Dijkstra's algorithm
    transport geography
    modes of transport
    spatial mobility
    transport accessibility
    aplikacja RoadLoad
    algorytm Dijkstry
    geografia transportu
    rodzaje transportu
    mobilność przestrzenna
    dostępność transportowa
    Opis:
    The purpose of this article is to present the authors' own software for predicting changes in the density and directions of traffic flows and to compare overall results of research on transport accessibility with the results returned in the study of transport accessibility conducted with the software (isochronic accessibility). Developed for research purposes, the authors' application is based on Dijkstra's algorithm, which is classified as one of the greedy ones and does not always return optimum results, even though it is considered to be generally accurate. In the course of the research, it was stated that the implementation of Dijkstra's algorithm in the RoadLoad tool is suitable for studying and prognosing phenomena, under the assumption that there are detailed data on the point of departure and destination for each trip. The tool enables us to research a spatial (cumulated values of network load) as well as time-spatial (network load at virtually any time) dimension of the phenomenon. It cannot be applied, however, without the knowledge of the transport behavior characteristics of the users of the road system.
    Źródło:
    Transport Problems; 2020, 15, 4, cz. 2; 227-240
    1896-0596
    2300-861X
    Pojawia się w:
    Transport Problems
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The use of the roadload application in geographical studies of flows generated by individual modes of transport
    Autorzy:
    Borowska-Stefańska, Marta
    Kowalski, Micha
    Wiśniewski, Szymon
    Domagalski, Adam
    Powiązania:
    https://bibliotekanauki.pl/articles/1841150.pdf
    Data publikacji:
    2020
    Wydawca:
    Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
    Tematy:
    RoadLoad application
    Dijkstra's algorithm
    transport geography
    modes of transport
    spatial mobility
    transport accessibility
    aplikacja RoadLoad
    algorytm Dijkstry
    geografia transportu
    rodzaje transportu
    mobilność przestrzenna
    dostępność transportu
    Opis:
    The purpose of this article is to present the authors' own software for predicting changes in the density and directions of traffic flows and to compare overall results of research on transport accessibility with the results returned in the study of transport accessibility conducted with the software (isochronic accessibility). Developed for research purposes, the authors' application is based on Dijkstra's algorithm, which is classified as one of the greedy ones and does not always return optimum results, even though it is considered to be generally accurate. In the course of the research, it was stated that the implementation of Dijkstra's algorithm in the RoadLoad tool is suitable for studying and prognosing phenomena, under the assumption that there are detailed data on the point of departure and destination for each trip. The tool enables us to research a spatial (cumulated values of network load) as well as time-spatial (network load at virtually any time) dimension of the phenomenon. It cannot be applied, however, without the knowledge of the transport behavior characteristics of the users of the road system.
    Źródło:
    Transport Problems; 2020, 15, 4, cz. 2; 227--240
    1896-0596
    2300-861X
    Pojawia się w:
    Transport Problems
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optimization model of freight transportation on the routes of international transport corridors
    Autorzy:
    Prokudin, Georgiy
    Oliskevych, Myroslav
    Сhupaylenko, Olexiy
    Maidanik, Kateryna
    Powiązania:
    https://bibliotekanauki.pl/articles/2141062.pdf
    Data publikacji:
    2020
    Wydawca:
    Fundacja Centrum Badań Socjologicznych
    Tematy:
    Dijkstra’s algorithm
    shortest routes
    freight transportation
    road network
    computer system
    Opis:
    The article deals with the modified Dijkstra’s algorithm of searching the shortest routes between all transport nodes of the road-transport network, which allows presenting the transport problem in the classical matrix form. This makes it possible to apply each of the known methods of optimal transport plans to solve it. The object of study is the transport process of freight transportation on the transport network by routes of international transport corridors. The purpose of the work is to improve the methods of solving the problems of finding the shortest routes on the transport network, including sections of international transport corridors. The research method is the analysis and modeling of freight transportation on road networks. The modified Dijkstra’s algorithm of finding the shortest paths between all nodes of the road-transport network was work out, which allows to represent the transport problem in the classical matrix form, i.e. in the form of a table of connections. This makes it possible to apply each of the known methods of constructing optimal plans of cargo transportation in the table of connections. The software complex based on the developed algorithm was designed in the algorithmic language Delphi, which was tested on the example of a transport problem set in the form of a road network, as well as complex testing and debugging of a computer system to support decision-making on the optimization of freight traffic on Ukrainian and Western Europe transport systems.
    Źródło:
    Journal of Sustainable Development of Transport and Logistics; 2020, 5, 1; 66-76
    2520-2979
    Pojawia się w:
    Journal of Sustainable Development of Transport and Logistics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Analysis of Graph Searching Algorithms for Route Planning in Inland Navigation
    Autorzy:
    Kazimierski, W.
    Sawczak, A.
    Wawrzyniak, N.
    Powiązania:
    https://bibliotekanauki.pl/articles/117106.pdf
    Data publikacji:
    2015
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    Inland Navigation
    route planning
    Graph Searching Algorithms
    Inland Waters
    Nautical Spatial Data
    Raster Data
    vector data
    Dijkstra’s Algorithm
    Opis:
    Route planning is one of the core functionalities of modern navigational systems also in inland waters. There is a possibility of at least partial automation of this process with the use of graph searching algorithms. Main problem here is to create a graph based on nautical spatial data. The paper presents research on examining dif-ferent graph searching methods for inland waters. The concept of using combined approach for vector and ras-ter data is given, followed by research results for raster data.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2015, 9, 2; 281-286
    2083-6473
    2083-6481
    Pojawia się w:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On the Fuel Saving Operation for Coastal Merchant Ships using Weather Routing
    Autorzy:
    Takashima, K.
    Mezaoui, B.
    Shoji, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/116404.pdf
    Data publikacji:
    2009
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    Weather Routing
    route planning
    Weather Navigation
    Coastal Merchant Ship
    Fuel Saving Operation
    Dijkstra’s Algorithm
    Simulation Study
    Fuel Consumption
    Opis:
    It is well known that Weather Routing is one of the effective ship operation methods to reduce fuel consumption and many studies have been conducted to develop the effective calculation methods. However, most studies were performed focusing on the ocean going ships, and there were few studies made for coastal ships. The authors propose a minimum fuel route calculation method for coastal ships that use the precise forecasted environmental data and the propulsion performance data of the ship on actual seas. In the proposed method, we use the Dijkstra’s algorithm to calculate an optimum minimum fuel route suitable for coastal ships. Simulation study was carried out to evaluate the effectiveness of the proposed method using two coastal ships. As the result of study, the authors confirmed that the proposed calculation method is effective for fuel consumption reduction and is applicable for the operation of coastal merchant ships.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2009, 3, 4; 401-406
    2083-6473
    2083-6481
    Pojawia się w:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Canonical greedy algorithms and dynamic programming
    Autorzy:
    Lew, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/970856.pdf
    Data publikacji:
    2006
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    programowanie dynamiczne
    Dijkstra
    greedy algorithm
    dynamic programming
    Opis:
    There has been little work on how to construct greedy algorithms to solve new optimization problems efficiently. Instead, greedy algorithms have generally been designed on an ad hoc basis. On the other hand, dynamic programming has a long history of being a useful tool for solving optimization problems, but is often inefficient. We show how dynamic programming can be used to derive efficient greedy algorithms that are optimal for a wide variety of problems. This approach also provides a way to obtain less efficient but optimal solutions to problems where derived greedy algorithms are nonoptimal.
    Źródło:
    Control and Cybernetics; 2006, 35, 3; 621-643
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-23 z 23

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies