| Popis: |
Based on the analysis of the current literature, mathematical modelling of the studied phenomenon was carried out. It was conducted according to the graph theory for vehicles transporting dangerous, oversized, and valuable cargo, moving within a transport network. The mapping of the parking areas included organisational, technical, and security aspects. The main algorithm determines the driving routes based on the parkings that meet the requirements specified by the carrier. These routes can ultimately be analysed and evaluated based on the parameters resulting from the formulated criterion functions. To verify the performance of the algorithm, its implementation was carried out in a computer environment using the Neo4j graph database. The transport network, consisting of 462 transport nodes and 602 transport links, was mapped based on the real national road network of the province in Poland. Data from 113 parking locations in the study area were included in the analysis. The research covered a total of three case studies, one for each vehicle type requiring specific parking conditions, for various input data. The results obtained allowed us to assess the validity of selecting particular routes and evaluating the scalability of the solution. The result of this work is a method, which, on the one hand, fits the current transportation requirements. On the other hand, it lends itself to scaling, extension by additional logical constraints, and is compatible with modern parking systems. |
