The main objective of this research is the optimization of the road traffic in cities by using a smart parking system
which is able to generate a better parking assignation for each (group of) vehicle. We state in this paper the assignment
parking slots problem to groups followed by its mathematical formulation. We have developed a heuristic-based
solution for assigning a set of vehicles to a set of parking slots. Moreover we have highlighted the most cost saving
solution depending on the data set used. An exhaustive numerical comparison between these HGASP and three
well-known algorithms shows that HGASP computes the best results across the board and performs better with large
problems.
As a future direction we intend to investigate other variants of the PSAPG such as adopting the online version for the
resolution of this problem.