Parking Search Modelling In Freight Transport And Private Traffic Simulation
Free (open access)
J. Muñuzuri, J. Racero & J. Larrañeta
This paper presents the work carried out in order to achieve better approximation to reality in traffic simulation. It is embedded within a line of research in the Organisation Department of the University of Seville aimed at developing a microscopic traffic simulator to use as a tool for urban planning issues related to freight transport and private traffic. For private traffic, the simulator uses traffic assignation algorithms which, from an O-D matrix, give the input to generate the route that each vehicle will follow through the links of the city network. Then, real-time movement algorithms calculate the actual movement of the vehicle through each link, interacting with the other vehicles present in the simulation. The model presented in this work is used for representation of the parking procedure at the end of the vehicle’s route, For freight transport, the shortest path algorithm was used for direct calculation of routes for freight vehicles. Knowing the different delivery stops that have to be made by the vehicle, the algorithm calculates the links that form the shortest route between each pair of consecutive stops. Then, when the freight vehicle arrives to a link where it must stop, the parking search model examines the parking spaces available, and determines which is the best one according to its distance to the final delivery point. That best parking space is then assigned to the vehicle.