Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Dijkstra’s algorithm

Sortuj według:

Ogranicz wyniki do:

Optimization model of freight transportation on the routes of international transport corridors

Prokudin Georgiy, Oliskevych Myroslav, Сhupaylenko Olexiy, Maidanik Kateryna

Journal of Sustainable Development of Transport and Logistics

2020

Vol. 5, No. 1

66--76

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.

Zastosowanie grafu widoczności w planowaniu trasy przejścia statku

Lazarowska A.

Zeszyty Naukowe Akademii Morskiej w Gdyni

2017

nr 98

116--121

W artykule przedstawiono propozycję rozwiązania problemu wyznaczania trasy przejścia statku przy zastosowaniu jednej z metod teorii grafów. Celem pracy była ocena możliwości zastosowania wybranej metody teorii grafów w planowaniu globalnej trasy przejścia statku, uwzględniającej statyczne ograniczenia nawigacyjne (lądy, mielizny). Środowisko nawigacyjne zostało zamodelowane w postaci grafu widoczności przy zastosowaniu algorytmu obrotowego zamiatania płaszczyzny. Najkrótsza trasa przejścia statku wyznaczono następnie za pomocą algorytmu Dijkstry.

The article presents a proposal for solving the problem of determining a ship’s safe path using one of the graph theory methods. The aim of the study was to evaluate the possibility of the selected graph theory method application in planning a ship’s global route, taking into account the static navigational restrictions (lands, shallows). The navigational environment was modelled as a visibility graph using a rotational plane sweep algorithm. The shortest ship’s path is then determined using a Dijkstra's algorithm.