A new heuristic for solving the parking assignment problem

Citations of this article
Mendeley users who have this article in their library.


It is often frustrating for drivers to find parking spaces, and parking itself is costly in almost every major city in the world. The search for a parking place is a task which can waste a lot of time and affect the efficiency of economic activities, social interactions, and the health of the environment. The planners of transport and city traffic must pay close attention to this issue in order to achieve an efficient management of mobility in smart cities. This work is intended to serve as an aid in the search for parking seeking the general interest of a group of drivers. We present an intensive description of the parking slots assignment problem for groups and apply it to a real case study. Also, we propose a hybrid genetic algorithm for solving this case and we compare it with three other algorithms in order to evaluate its performance.




Abidi, S., Krichen, S., Alba, E., & Molina, J. M. (2015). A new heuristic for solving the parking assignment problem. In Procedia Computer Science (Vol. 60, pp. 312–321). Elsevier B.V. https://doi.org/10.1016/j.procs.2015.08.132

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free