In 2001 he moved to the Department of "Operation and Repair of Automotive Engineering" of the National University "Lviv Polytechnic" as an associate professor. In 2002 he was awarded the academic title of associate professor of the Department of Operation and Repair of Automotive Engineering.From 2018 studied for a doctorate at the National Transport University (Kyiv). He further works on the theory of transport processes of main road transport. He studied the development of transport and technological systems of road transport, which use modern information technology.Has been working at the Department of Operation and Technical Service since 2019.In total, he is the author of more than 52 publications, including: 48 scientific articles in professional journals
This article is devoted to the coordination of single stages of the multimodal delivery process, ... more This article is devoted to the coordination of single stages of the multimodal delivery process, taking into account the fact that the process is discrete in its content. The tact, which has the content of a time window for performing the operation is used for discrete processes. Due to the fact that multimodal transportation of goods is carried out on a large network, time is one of the most important criteria for their perfection. Two timing criteria are applied in the article, which take into account the fact that the multimodal process must be synchronized and that the transportation of a large group of goods can be carried out in separate parts. An estimation criterion was also applied, which takes into account constant, variable, contingent costs, which are carried out depending on the structure of the process. The goal of the study is to create such multimodal cargo delivery routes that are characterized by the highest level of selec-tion criteria. In contrast to known studie...
An algorithm for optimizing the routes of a set of vehicles used for the collection and removal o... more 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.
Розглянуто задачу оптимізації транспортних циклів міжміських велико-гуртових перевезень вантажів,... more Розглянуто задачу оптимізації транспортних циклів міжміських велико-гуртових перевезень вантажів, які складаються з декількох поїздок. Запропоновано часову модель у вигляді графу станів транспортної системи, а також алгоритм її впорядкування. Описано можливість пошуку взаємно скоординованих маршрутів довільної кількості транспотних засобів і досягнення мінімального їх простоювання при повному виключенні марних пробігів. Показано, що алгоритм дає гарантований точний розв’язок оптимізаційної задачі.
Interaction of vehicles on an intercity highway is considered. The vehicle control model here is ... more Interaction of vehicles on an intercity highway is considered. The vehicle control model here is idealized, close to the 4th generation automated intelligent transport system. Each vehicle has the desired motion program, independent of the driver's motives, which is justified by minimum resource consumption and compliance with the desired schedule. The diversity of programs affects their unwanted change. The aim was to identify the dependence of the actual vehicle speed on traffic flow parameters. The main task was to reveal a direct parameter for changing the motion program. The use of simulation models based on cellular automata is substantiated. A new cellular automaton, which is a sliding window with a reference point, which is the observer vehicle is developed. The number of objects in the field increases periodically and is constant. All cells on the left and right of the reference point of the automaton form the information field, or the total length of the automaton. The...
The article is devoted to the problem of effective use of cross-docking as a technology of cargo ... more The article is devoted to the problem of effective use of cross-docking as a technology of cargo delivery with increased time requirements, which allows to resolve the contradictions of guaranteed delivery time ensuring and the efficiency of the existing fleet of trucks. The process of delivery organization is considered as the ordering on the transport network of many discrete freight flows in the form of their phases. If qualitative and / or quantitative changes do not occur from phase to phase with the flow, then the tact of such flow is constant. However, cross-docking flows change the size of the band of moving goods. Cargo can be moved as intended by any group size, which, however, is limited by the maximum and minimum values. A two-stage algorithm for solving the problem has been developed. The transport network is represented as a graph. The content of the route search problem is optimization, as it consists of multiple selections from the initial graph of arcs in the presen...
The article deals with the interrelated processes of cargo transportation on the main road transp... more The article deals with the interrelated processes of cargo transportation on the main road transport network. The problem of distribution of available vehicles was stated. The flows of incoming orders are stochastic, but have no features of the simplest. On the specified territory, the orders for long distance transportations appear and are repeated with random periodicity during a fixed period. Each order has its time window. Vehicles of one carrier are placed on a transport network in random order, according to the latest run performed. To execute the orders, motor-vehicle trains take the cargo at the location point, or in the absence of loads, move to the nearest transport point, where such orders appear. The typical situation, when even if there are enough vehicles, clients are denied transportation or vehicles have to stand idle or travel unloaded, was analyzed.The simulation modeling procedure was developed. With the help of the random number generator, the set of coordinates ...
The article is devoted to the problem of selection and distribution of known orders for long-dist... more The article is devoted to the problem of selection and distribution of known orders for long-distance transportation of goods by small transport companies. The ordering of the incoming flow of orders for transportation of cargoes taking into account time restrictions on their performance is considered. The incoming order flows of such enterprises are stochastic and different in the structure of transport cycles. The random nature of orders leads to the fact that their execution requires additional unproductive costs of the carrier's resources. It is taken into account that orders for transportation are unequally correlated. The article assumes that the compatibility of two orders, which are performed in a common route by one vehicle, characterizes the additional time spent on mileage and downtime. The pairwise coefficient of order compatibility is the ratio of the "net" time for order fulfillment to the time required for preparatory additional operations and trips in c...
This article is devoted to the coordination of single stages of the multimodal delivery process, ... more This article is devoted to the coordination of single stages of the multimodal delivery process, taking into account the fact that the process is discrete in its content. The tact, which has the content of a time window for performing the operation is used for discrete processes. Due to the fact that multimodal transportation of goods is carried out on a large network, time is one of the most important criteria for their perfection. Two timing criteria are applied in the article, which take into account the fact that the multimodal process must be synchronized and that the transportation of a large group of goods can be carried out in separate parts. An estimation criterion was also applied, which takes into account constant, variable, contingent costs, which are carried out depending on the structure of the process. The goal of the study is to create such multimodal cargo delivery routes that are characterized by the highest level of selec-tion criteria. In contrast to known studie...
An algorithm for optimizing the routes of a set of vehicles used for the collection and removal o... more 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.
Розглянуто задачу оптимізації транспортних циклів міжміських велико-гуртових перевезень вантажів,... more Розглянуто задачу оптимізації транспортних циклів міжміських велико-гуртових перевезень вантажів, які складаються з декількох поїздок. Запропоновано часову модель у вигляді графу станів транспортної системи, а також алгоритм її впорядкування. Описано можливість пошуку взаємно скоординованих маршрутів довільної кількості транспотних засобів і досягнення мінімального їх простоювання при повному виключенні марних пробігів. Показано, що алгоритм дає гарантований точний розв’язок оптимізаційної задачі.
Interaction of vehicles on an intercity highway is considered. The vehicle control model here is ... more Interaction of vehicles on an intercity highway is considered. The vehicle control model here is idealized, close to the 4th generation automated intelligent transport system. Each vehicle has the desired motion program, independent of the driver's motives, which is justified by minimum resource consumption and compliance with the desired schedule. The diversity of programs affects their unwanted change. The aim was to identify the dependence of the actual vehicle speed on traffic flow parameters. The main task was to reveal a direct parameter for changing the motion program. The use of simulation models based on cellular automata is substantiated. A new cellular automaton, which is a sliding window with a reference point, which is the observer vehicle is developed. The number of objects in the field increases periodically and is constant. All cells on the left and right of the reference point of the automaton form the information field, or the total length of the automaton. The...
The article is devoted to the problem of effective use of cross-docking as a technology of cargo ... more The article is devoted to the problem of effective use of cross-docking as a technology of cargo delivery with increased time requirements, which allows to resolve the contradictions of guaranteed delivery time ensuring and the efficiency of the existing fleet of trucks. The process of delivery organization is considered as the ordering on the transport network of many discrete freight flows in the form of their phases. If qualitative and / or quantitative changes do not occur from phase to phase with the flow, then the tact of such flow is constant. However, cross-docking flows change the size of the band of moving goods. Cargo can be moved as intended by any group size, which, however, is limited by the maximum and minimum values. A two-stage algorithm for solving the problem has been developed. The transport network is represented as a graph. The content of the route search problem is optimization, as it consists of multiple selections from the initial graph of arcs in the presen...
The article deals with the interrelated processes of cargo transportation on the main road transp... more The article deals with the interrelated processes of cargo transportation on the main road transport network. The problem of distribution of available vehicles was stated. The flows of incoming orders are stochastic, but have no features of the simplest. On the specified territory, the orders for long distance transportations appear and are repeated with random periodicity during a fixed period. Each order has its time window. Vehicles of one carrier are placed on a transport network in random order, according to the latest run performed. To execute the orders, motor-vehicle trains take the cargo at the location point, or in the absence of loads, move to the nearest transport point, where such orders appear. The typical situation, when even if there are enough vehicles, clients are denied transportation or vehicles have to stand idle or travel unloaded, was analyzed.The simulation modeling procedure was developed. With the help of the random number generator, the set of coordinates ...
The article is devoted to the problem of selection and distribution of known orders for long-dist... more The article is devoted to the problem of selection and distribution of known orders for long-distance transportation of goods by small transport companies. The ordering of the incoming flow of orders for transportation of cargoes taking into account time restrictions on their performance is considered. The incoming order flows of such enterprises are stochastic and different in the structure of transport cycles. The random nature of orders leads to the fact that their execution requires additional unproductive costs of the carrier's resources. It is taken into account that orders for transportation are unequally correlated. The article assumes that the compatibility of two orders, which are performed in a common route by one vehicle, characterizes the additional time spent on mileage and downtime. The pairwise coefficient of order compatibility is the ratio of the "net" time for order fulfillment to the time required for preparatory additional operations and trips in c...
Uploads