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ę "Oliskevych, Myroslav" wg kryterium: Autor

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-3 z 3
    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ł:
    The optimization of trucks fleet schedule in view of their interaction and restrictions of the European agreement of work of crews
    Autorzy:
    Oliskevych, Myroslav
    Kovalyshyn, Stepan
    Magats, Myron
    Shevchuk, Viktor
    Sukach, Oleh
    Powiązania:
    https://bibliotekanauki.pl/articles/1841183.pdf
    Data publikacji:
    2020
    Wydawca:
    Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
    Tematy:
    scheduling
    crew of vehicles
    trucks fleet
    disjunctive graph
    planowanie
    załoga pojazdów
    flota ciężarówek
    graf dysjunkcyjny
    Opis:
    The importance of compliance with the schedule of work of road trains on the highway transport network of the European Union is shown. The possible options for work and rest modes for truck drivers on international routes have been analyzed. A model for optimizing the truck fleet operation plan has been developed. This model has two levels, that is, the general graph contains subgraphs designed with incompatible vertices to determine the active and shortest schedule. Each of the subgraphs reflects alternative routes and schedules of a truck. The model also includes restrictions on the total cycle time and active period duration of available unloading points. To find the shortest schedule, integer programming with a guaranteed optimal solution was applied. Testing of the proposed algorithm was performed for the example of serving orders for international freight transportation between the cities of Ukraine, Poland, and the Czech Republic. The active schedule is based on the criterion of the minimum of the total duration of drivers’ work. The results obtained are valid, consistent with the rules of the European Agreement. They indicate that the choice of the best schedule for a single car on a unitary route is not the best solution for the entire truck fleet and the entire flow of orders.
    Źródło:
    Transport Problems; 2020, 15, 2; 157-170
    1896-0596
    2300-861X
    Pojawia się w:
    Transport Problems
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An algorithm for garbage truck routing in cities with a fixation on container filling level
    Autorzy:
    Oliskevych, Myroslav
    Danchuk, Victor
    Powiązania:
    https://bibliotekanauki.pl/articles/27314061.pdf
    Data publikacji:
    2023
    Wydawca:
    Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
    Tematy:
    routing
    lexical search
    garbage collection
    capacity limitation
    trasowanie
    wyszukiwanie leksykalne
    zbieranie śmieci
    ograniczenie pojemności
    Opis:
    An algorithm for optimizing the routes of a set of vehicles used for the collection and removal of municipal solid waste in a metropolis is proposed. The algorithm eliminates the problem of applying heuristic methods for multi-agent optimization, which is NP non-deterministic polynomial-time-hard. The application of the algorithm leads to a guaranteed exact solution. Through the application of restrictions on the carrying capacity of vehicles, the size of the input matrix representing the transport network can be reduced to an adequate size. This process uses statistical information about the filling levels of container waste bins. The algorithm is applied to an example of two megacities. The shortest routes are built for different numbers of points (from 12 to 72) on the route. The dependence of the total mileage on the number of involved vehicles is studied.
    Źródło:
    Transport Problems; 2023, 18, 1; 75--87
    1896-0596
    2300-861X
    Pojawia się w:
    Transport Problems
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-3 z 3

      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