Nowadays a lot of people can afford and chose the car as a transport mode. It can be observed that only one or two people is travelling within that. In a busy town, as a result there are more cars present then the parking capacity can support, so finding a parking spot requires.significant time.
This increased search time will have numerous economic and social consequences, so we can see it as an important task to reduce it.
There is a new parking search algorithm developed at BME TMIT, which tries to solve this problem as much as possible. This is named as ParkingRoute. The analysis of this algorithm could happen with running simulations.
In this thesis I will deal with these simulations. Using an already existing traffic simulator, I implemented the ability to search for parking spot, and the specific algorithm itself. I also implemented another simple algorithm which tries to mimic human behaviour to a certain level.
Running measuremens, I show how one strategy compares to another, and how much compute capacity is required for the ParkingRoute algorithm.