Informacja

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

Wyszukujesz frazę "route planning" wg kryterium: Wszystkie pola


Tytuł:
Planning of the interregional tourist route in the Urals
Autorzy:
Zyrianov, Aleksandr I.
Zyrianova, Inna S.
Powiązania:
https://bibliotekanauki.pl/articles/2054599.pdf
Data publikacji:
2021-06-30
Wydawca:
Uniwersytet im. Adama Mickiewicza w Poznaniu
Tematy:
tourism
tourist itinerary
interregional routes
travel planning
route design
tourist cruises
Russia
Ural
Opis:
The article aims to attract the attention of geographers to the development of technology for the design of tourist routes. The world and Russian experience of designing long interregional tourist routes is considered. The au- thors’ approaches to route design are illustrated by the example of the Urals. Interregional tourist routes in Russia are actively developed with the support of the government. They are initiated by interacting regions and especially federal districts. Interregional routes are tours covering several adjacent regions or regions that are close not territorially, but thematically in tourist aspects. Such routes are quite different, but they have mainly cultural and informative goals as well as an excursion, transport and sometimes cruise style. Among all the interregional routes, the ‘Golden Ring’ and the ‘Volga-Kama’ river cruises are exemplary, among which the ‘Moskovskaya krugosvetka’ stands out due to the uniqueness of the ring shape of the route. The geographic features of the Urals are at the heart of the logical decisions for the preparation of the interregional tourist project ’The Great Ural Route’. The Urals have attractive, image, logistic and other opportunities for organising a large tourist route. A route should be developed for residents of the country and foreign guests, which will introduce the most striking and characteristic objects of the macro region as a whole. Moreover, the annular shape of the route is most preferred. It is advisable to lay the route in most of the Ural regions. It should include the main cities, landscapes of different natural zones, the most significant excursion sites and distinctive territories. Geographic route design technologies make it possible to make them relevant for a long time.
Źródło:
Quaestiones Geographicae; 2021, 40, 2; 109-119
0137-477X
2081-6383
Pojawia się w:
Quaestiones Geographicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Sailing route planning method considering various user categories
Autorzy:
Życzkowski, Marcin
Powiązania:
https://bibliotekanauki.pl/articles/1573877.pdf
Data publikacji:
2020
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
sailing vessel
weather routing
multi-criteria
navigation
comfort
Opis:
The article describes the methodology related to determining the multi-criteria routes for sailing ships. Details of sea area discretisation and discretisation of the description of the sailing vessel properties and manoeuvring principles are shown. User requirements were specified (for five different categories of users) and on this basis the criteria for selecting the most suitable shipping route were formulated. The presented algorithm recommends a route for a given user category by means of defined restrictions and configuration parameters. The applied multi-criteria approach proves the universality and usability of the sailing ship route planning method.
Źródło:
Polish Maritime Research; 2020, 3; 149-158
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Sailing vessel routing considering safety zone and penalty time for altering course
Autorzy:
Życzkowski, M.
Powiązania:
https://bibliotekanauki.pl/articles/116895.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
ships manoeuvering
sailing vessels
safety zone
penalty time
altering course
weather forecast
route planning
path finding
Opis:
In this paper we introduce new model for simulation sea vessel routing. Besides a vessel types (polar diagram) and weather forecast, travel security and the number of maneuvers are considered. Based on these data both the minimal travelling costs and the minimal processing time are found for different vessels and different routes. To test our model the applications SailingAssistance wad improved. The obtained results shows that we can obtain quite acceptable results.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2017, 11, 2; 235-240
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ł:
Prediction of ship's speed through ground using the previous voyage's drift speed
Autorzy:
Yamane, D.
Kano, T.
Powiązania:
https://bibliotekanauki.pl/articles/24201461.pdf
Data publikacji:
2023
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
machine learning
weather routing
ship's speed estimation
drift speed
algorithm
route planning
tidal current
Opis:
In recent years, 'weather routing' has been attracting increasing attention as a means of reducing costs and environmental impact. In order to achieve high-quality weather routing, it is important to accurately predict the ship's speed through ground during a voyage from ship control variables and predicted data on weather and sea conditions. Because sea condition forecasts are difficult to produce in-house, external data is often used, but there is a problem that the accuracy of sea condition forecasts is not sufficient and it is impossible to improve the accuracy of the forecasts because the data is external. In this study, we propose a machine learning method for predicting speed through ground by considering the actual values of the previous voyage’s drift speed for ships that regularly operate on the same route, such as ferries. Experimental results showed that this method improves the prediction performance of ship’s speed through ground.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2023, 17, 1; 129--137
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ł:
Modyfikacje algorytmów planowania trasy uwzględniające ograniczenia czasowe i odległościowe
Modification of path-finding algorithms introducing time and distance limitations
Autorzy:
Wolanin, Mateusz
Korniszuk, Klaudia
Smołka, Jakub
Powiązania:
https://bibliotekanauki.pl/articles/98100.pdf
Data publikacji:
2019
Wydawca:
Politechnika Lubelska. Instytut Informatyki
Tematy:
wyznaczanie trasy
rower miejski
algorytm A*
algorytm BFS
route planning
bike sharing system
algorithm A*
algorithm BFS
Opis:
Artykuł przedstawia modyfikacje algorytmów wyszukiwania ścieżki w grafie mające na celu wprowadzenie ograniczeń: czasowych lub odległościowych do znalezionej trasy. Zmodyfikowane zostały dwa algorytmy: A* oraz BFS. Zaproponowana została również modyfikacja algorytmu A*, która łączy atuty tych dwóch algorytmów – wygenerowanie najkrótszych tras o jak najmniejszej liczbie wierzchołków. Zmodyfikowane algorytmy umożliwią stworzenie aplikacji pozwalającej na łatwiejsze i bardziej oszczędne poruszanie się z wykorzystaniem usług typu rowerem miejski.
This paper describes modifications of path-finding algorithms. The modifications add time and distance constraints to generated paths. A* and BFS algorithms are modified. Additionally, A* algorithm modification which combines the advantages (generating the shortest routes with the smallest number of vertices) of A* and BFS is presented.. This allows for creating a route planning app that enables users of bike sharing services to travel more easily and economically.
Źródło:
Journal of Computer Sciences Institute; 2019, 10; 18-23
2544-0764
Pojawia się w:
Journal of Computer Sciences Institute
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of the 1-2-3 Rule for Calculations of a Vessel’s Route Using Evolutionary Algorithms
Autorzy:
Wiśniewski, B.
Medyna, P.
Chomski, J.
Powiązania:
https://bibliotekanauki.pl/articles/116117.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
tropical cyclones avoidance
Fuzzy Domain
Weather Navigation
Tropical Cyclones
1-2-3 Rule
vessels route
evolutionary algorithms
route planning
Opis:
An example is shown of the 1-2-3 rule application for calculations to determine a route avoiding tropical cyclones. The dynamic programming used is based on regularly received weather reports containing present and forecast data on tropical cyclones. The results were compared with the post factum calculated route which utilized only weather analyses concerning the relevant moments of the voyage and with routes calculated using the cyclone fuzzy domain as an area dangerous to navigation. The calculations were made in the evolutionary algorithms environment.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2009, 3, 2; 143-146
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ł:
Integrated problem of ship route planning
Autorzy:
Wiśniewski, B.
Medyna, P.
Chomski, J.
Mąka, M.
Powiązania:
https://bibliotekanauki.pl/articles/393824.pdf
Data publikacji:
2011
Wydawca:
Polskie Stowarzyszenie Telematyki Transportu
Tematy:
planowanie trasy statku
ograniczenia
procedury
ship route planning
limitations
procedures
Opis:
Planning and realization of ship route is a complex problem, which consists of elements from different disciplines. It is necessary to take into account: the formal requirements, the organization of traffic in restricted areas, exploitation limitations of the ship; economic issues relating to the costs of fuel and the costs associated with the possible unscheduled reaching the ship at the port of destination and waiting for unloading. It is important to maintain safety conditions related to extreme weather conditions. As the sailing is done on the changing weather conditions, considerable issue is the problem associated with the acquisition, processing and integration of weather data. Issues connected directly with the procedures of route computation are also important - the choice of optimization algorithm, matching the speed characteristics, the state of load. Increasingly being taken into account as restriction of navigation has to be the threat of piracy and terrorism. In the planning and realization of a ship voyage important issue is so called human factor and thus the experience of the master, which will include a decision as to the extent of detail of route planning, taking into account the restrictions importance and eventual adoption or not the proposed route
Źródło:
Archives of Transport System Telematics; 2011, 4, 4; 58-64
1899-8208
Pojawia się w:
Archives of Transport System Telematics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Problems of sea route planning for a ship operating in piracy-threatened areas: the Indian Ocean
Problemy wyboru drogi morskiej statku operującego na akwenach zagrożonych atakami pirackimi na przykładzie Oceanu Indyjskiego
Autorzy:
Wiśniewski, B.
Siódmak, S.
Powiązania:
https://bibliotekanauki.pl/articles/359986.pdf
Data publikacji:
2011
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
planowanie podróży statku
piraci
route planning
pirates
Opis:
One of the essential issues in the multi-criteria process of voyage planning is the safety of personnel, cargo and the ship itself, accounting for the optimized voyage time and costs. Apart from sometimes difficult weather and navigational conditions, pirates have been a new major threat to the safety of navigation since the beginning of this century. It is because of piracy, traditional routes of vessels differ from seasonal ones, and their threat is taken into consideration in decisions concerning the choice of the sea route of a ship. This article indicates the most dangerous routes in terms of pirate attacks occurrence over the last few years in the Indian Ocean. An attempt is made to relate the number of pirate attacks to hydrometeorological conditions and to define the effect of pirates activities on the problems of choosing the vessel sea route.
W wielokryterialnym procesie planowania podroży statku jednym z najważniejszych zagadnień jest bezpieczeństwo znajdujących się na nim ludzi, ładunku i samego statku przy jednoczesnej optymalizacji czasu i kosztów podróży. Od kilku lat bezpieczeństwu nawigacji obok warunków pogodowych i nawigacyjnych zaczęli zagrażać piraci, którzy stali się głównym niebezpieczeństwem nawigacji początku XXI w. Właśnie ze względu na nich, dotychczasowe trasy statków odbiegają od sezonowych, a zagrożenie, jakie niosą, uwzględnia się w procesie decyzyjnym wyboru drogi morskiej statku. W artykule wskazano najbardziej niebezpieczne obszary pod względem występowania ataków pirackich w ostatnich latach na przykładzie Oceanu Indyjskiego. Dokonano próby powiązania liczby ataków pirackich z warunkami hydrometeorologicznymi, wskazując jednocześnie na wpływ aktywności piratów na problemy wyboru drogi morskiej statku.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2011, 26 (98); 114-119
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficiency of a voluntary speed reduction algorithm for a ship’s great circle sailing
Autorzy:
Wang, H.
Mao, W.
Eriksson, L.
Powiązania:
https://bibliotekanauki.pl/articles/117253.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
great circle sailing
algorithm, ship’s sailing route
route planning
Dynamic Programming (DP)
great circle route
great circle (orthodrome)
Estimated Time of Arrival (ETA)
Opis:
The great-circle is the shortest distance between two points on the surface of the earth. When planning a ship’s sailing route (waypoints and forward speeds) for a specific voyage, the great circle route is commonly considered as a reference route, especially for ocean-crossing seaborne transport. During the planning process, the upcoming sea weather condition is one of the most important factors affecting the ship’s route optimization/planning results. To avoid encountering harsh conditions, conventional routing optimization algorithms, such as Isochrone method and Dynamic Programming method, have been developed/implemented to schedule a ship’s optimal routes by selecting waypoints around the great circle reference route based on the ship’s operational performances at sea. Due to large uncertainties in sea weather forecast that used as inputs of these optimization algorithms, the optimized routes may have worse performances than the traditional great circle sailing. In addition, some shipping companies are still sailing in or making charting contracts based on the great circle routes. Therefore, in this study, a new optimization algorithm is proposed to consider the voluntary speed reduction with optimal speed configuration along the great circle course. The efficiency of this method is investigated by comparing these two methods for optimal route planning with respect to ETA and minimum fuel consumption. A container ship sailing in the North Atlantic with full-scale performance measurements are employed as the case study vessels for the comparison.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2020, 14, 2; 301-308
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ł:
Bi-objective maritime route planning in pirate-infested waters
Autorzy:
Vaňek, O.
Hrstka, O.
Kopřiva, Š.
Faigl, J.
Pěchouček, M.
Powiązania:
https://bibliotekanauki.pl/articles/906066.pdf
Data publikacji:
2015
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
maritime piracy
risk-aware planning
optimization
risk analysis
modeling
FTA
Opis:
Contemporary maritime shipping is subject to a large number of constraints given by tight shipping schedules and very low margins. Additionally, problematic areas with increased security needs dynamically changing in time, combined with seasonal oceanographic and meteorological conditions pose a challenging voyage planning problem. In this work we present a risk-aware voyage planner taking into account spatio-temporal environmental conditions. The planner is based on a graph-based search algorithm A* . We discretize the required area into a graph, we store various layers of information into the edges of the graph (such as risk and weather conditions) in a form of numeric weights and we define a bi-objective planning problem with a tradeoff between security and duration of the voyage. The nature of the algorithm guarantees a complete and optimal solution in a form of an optimized voyage with respect to the criterion function composed of the two weighted components, i.e, duration and security of the voyage. We demonstrate the approach on our area of interest: Indian Ocean. We use NATO piracy activity risk surface as the risk layer and we compute all transit voyages between relevant routing points in the area. Finally, thanks to the discretization of the problem, we are able to integrate corridors imposed by the shipping authorities and evaluate additional what-if scenarios with extended corridor systems. The resulting planner is exposed to the public using a web service with an easy interface requiring start time of the voyage and the origin and the destination point of voyage. Combined with an expressive visualization, this tool demonstrates the capabilities of the proposed solution.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2015, 43 (115); 115-124
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Wyznaczanie ryzyka planowania trasy przejazdu z wykorzystaniem modelu probabilistycznego
Determination of risk planning a route with the use of a probability model
Autorzy:
Topolska, K.
Powiązania:
https://bibliotekanauki.pl/articles/312479.pdf
Data publikacji:
2018
Wydawca:
Instytut Naukowo-Wydawniczy "SPATIUM"
Tematy:
planowanie transportu
planowanie trasy
szacowanie ryzyka
metody probabilistyczne
system telematyczny
transport planning
route planning
risk assessment
probabilistic methods
telematic system
Opis:
Niniejsza praca ma na celu przybliżyć pojęcia z zakresu metod probabilistycznych w zadaniu planowania trasy przejazdu w systemach telematycznych. W zadaniu klasyfikacji zastosowano model bazujący na probabilistycznym klasyfikatorze Bayesa i funkcji gęstości prawdopodobieństwa. W części pierwszej pracy zostały opisane problemy planowania tras przejazdów we współczesnych systemach telematycznych. Część druga zawiera teoretyczne podstawy klasyfikatorów bazujących na twardych metodach matematycznych. Aby taki model miał jakikolwiek sens, należy uwzględnić pomniejsze rodzaje ryzyka związane z procesem transportu. Artykuł prezentuje metodę doboru najbardziej optymalnych parametrów do zadania planowania transportu. Tutaj niewątpliwie autor artykułu zwraca uwagę na metodę redukcji zmiennych niezbędnych do planowania z zastosowaniem metody analizy czynnikowej składowych głównych z metoda rotacji czynników Varimax znormalizowaną metodą Kaisera dla cech ilościowych. Rozdział trzeci poświęcony jest procesowi planowania tras przejazdu, ryzyku jakie jest z tym planowaniem związane.
This paper aims to familiarize readers with notions related to probabilistic methods used for planning routes in telematics systems. The classification task made use of the model based on probabilistic Bayes’ classifier and the probability density function. The first part of the paper describes problems with planning routing in contemporary telematics systems. The second part covers a theoretical basis of classifiers based on hard mathematical methods. If such a model is to make sense, it should account for smaller kinds of risk related to a transport process. This paper presents a method of selecting the most optimal parameters in transport planning. Its author draws attention to the variable reduction method necessary for planning supported by a factor analysis of principal components together with Varimax rotation normalized with Kaiser’s method for quantitative features. The third part is devoted to the process of planning routes and the related risk.
Źródło:
Autobusy : technika, eksploatacja, systemy transportowe; 2018, 19, 6; 266-270, CD
1509-5878
2450-7725
Pojawia się w:
Autobusy : technika, eksploatacja, systemy transportowe
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Military route planning in battlefield simulation: effectiveness problems and potential solutions
Autorzy:
Tarapata, Z.
Powiązania:
https://bibliotekanauki.pl/articles/309343.pdf
Data publikacji:
2003
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
battlefield simulation
route planning
shortest paths
effectiveness problems
computational complexity
Opis:
Path searching is challenging problem in many domains such as simulation war games, robotics, military mission planning, computer generated forces (CGF), etc. Effectiveness problems in military route planning are related both with terrain modelling and path planning algorithms. These problems may be considered from the point of view of many criterions. It seems that two criterions are the most important: quality of terrain reflection in the terrain model and computational complexity of the on(off)-line path planning algorithm. The paper deals with two above indicated problems of route planning effectiveness. Comparison of approaches used in route planning is presented. The hybrid, terrain merging-based and partial path planning, approach for route planning in dynamically changed environment during simulation is described. It significantly increase effectiveness of route planning process. The computational complexity of the method is given and some discussion for using the method in the battlefield simulation is conducted. In order to estimate how many times faster we can compute problem for finding shortest path in network with n big squares (b-nodes) with relation to problem for finding shortest path in the network with V small squares (s-nodes) acceleration function is defined and optimized.
Źródło:
Journal of Telecommunications and Information Technology; 2003, 4; 47-56
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
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ł:
Application of Bon Voyage 7.0 (AWT) to programming of an ocean route of post-Panamax container vessel in transpacific voyage Seattle – Pusan 26.08.2015, 1600UTC – 05.09.2015, 2100UTC
Autorzy:
Szymański, M.
Wiśniewski, B.
Powiązania:
https://bibliotekanauki.pl/articles/135418.pdf
Data publikacji:
2016
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
ocean voyage route optimization
ocean voyage route programming
voyage planning
Bon Voyage system
fuel criterion
ECA
Opis:
The results of testing the Bon Voyage system for an ocean voyage are presented in this paper. The main assumptions of testing were: ETD – 26.08.2016 and ETA – 05.09.2016, as established by the owner. All the data have been obtained from an actual voyage of a post-Panamax shipping container through the North Pacific. Testing was repeated again after completion of the voyage (post-voyage analysis). The data indicate that improved results with respect to fuel consumption could have been achieved using a different moment of second stage testing. Possible problems at planning, programming, and optimizing of the route leading through the ECA (Emission Control Area) zones with the use of onboard routing systems are also presented.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2016, 48 (120); 182-186
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Route planning in dynamic graphs with linear changing and preprocessing for speed-up
Planowanie podróży w dynamicznych grafach z uwzględnieniem wstępnie przetworzonego i zmieniającego się liniowo przyspieszenia
Autorzy:
Szűcs, G.
Powiązania:
https://bibliotekanauki.pl/articles/374763.pdf
Data publikacji:
2010
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
planowanie trasy
sieć drogowa
graf dynamiczny
route planning
road network
dynamic graph
Opis:
The goal of this paper is to work out a concept for route planning in a road network, where the costs of roads are not constant, but changing in a linear way. The solution developed is based on the classical Dijkstra's algorithm, which helps to find the route with minimal cost. The new algorithm takes the varying into account in order to find out the best route. This search refers not only to a moment of the departure but to the whole duration of the travel. A speed-up technique has been developed for preprocessing before run time. This preprocessing phase helps to give back the route with minimal cost for the user quickly in run time query. A numerical example has been presented to show the detailed steps of the algorithm and the speed-up technique.
Celem artykułu jest wypracowanie koncepcji planowania tras (trasowania) w sieci drogowej, w której koszty połączeń nie są stałe, lecz zmieniają się w sposób liniowy. Zastosowane rozwiązanie opiera się na klasycznym algorytmie Dijkstra, który umożliwia znajdowanie tras po koszcie minimalnym. Proponowany algorytm uwzględnia dynamiczną różnorodność tras, w celu generowania najkorzystniejszej trasy. Jej poszukiwanie uwzględnia nie tylko momenty rozpoczęcia podróży, ale także czas trwania całej podróży. Technikę przyspieszania (speed-up) rozwinięto, w celu wstępnego przetwarzania przed fazą wykonania. Faza wstępnego przetwarzania pozwala szybciej pozyskać trasę, po koszcie minimalnym dla użytkownika. W artykule zostały zaprezentowane liczne przykłady, w których przedstawiono kolejne kroki algorytmu i techniki przyspieszania.
Źródło:
Transport Problems; 2010, 5, 2; 49-58
1896-0596
2300-861X
Pojawia się w:
Transport Problems
Dostawca treści:
Biblioteka Nauki
Artykuł

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