The vehicle routing problem is a general name for a whole set of problems in which a group of vehicles located in a depot needs to visit all customers with the condition that only one vehicle visits each customer and that all vehicles return to the depot. Vehicle routing problems are a generalization of the traveling salesman problem. The purpose of present survey in the field of vehicle routing problem (VRP) is to classify different well known variants of VRP according to the type of objects with previously defined system performance was applied . These variants include a whole class of problems where a set of routes for a car fleet located in one or more depots should be determined for some geographically distant nodes or customers, at that, the purpose of routing is the optimization of the series of custom- ers requests (number of vehicles, distance traveled, time spent in vehicles or user waiting time).
In this work, the characteristics of the traffic flow on the section of the Gradiška- Banja Luka highway, which is part of the European road route E-661, were analyzed in the period from 2019 to 2022. Data on the size of flow requests were taken from the database of the toll station “Jakupovci” on the Gradiška- Banja Luka highway. When defining the size of the flow request, the structure of the traffic flow was also taken into account, in accordance with the categories according to which the toll is collected. The period in which the analysis of flow characteristics was performed also includes the period in which the coronavirus pandemic reigned, when certain travel rules and prohibitions were in force. In accordance with that, the work will specifically analyze the impact of the COVID 19 pandemic on the characteristics of the traffic flow on the Gradiška- Banja Luka highway section. Given that the
„Jakupovci“ toll station is the busiest toll station on the Gradiška- Banja Luka highway, the results of the analysis can be applied to other sections of highways in the Republic of Srpska.
The vehicle routing problem is a general name for a whole set of problems in which a group of vehicles located in a depot needs to visit all customers with the condition that only one vehicle visits each customer and that all vehicles return to the depot. Vehicle routing problems are a generalization of the traveling salesman problem. The purpose of present survey in the field of vehicle routing problem (VRP) is to classify different well known variants of VRP according to the type of objects with previously defined system performance was applied . These variants include a whole class of problems where a set of routes for a car fleet located in one or more depots should be determined for some geographically distant nodes or customers, at that, the purpose of routing is the optimization of the series of custom- ers requests (number of vehicles, distance traveled, time spent in vehicles or user waiting time).
