Inefficient utilization of existing parking resources is the main cause of parking difficulties, especially in metropolises. Shared parking allocation based on the online parking reservation system (PRS) is an effective way to deal with the inefficient utilization since it increases available parking resources through sharing and avoids blind search through reservation and allocation. This study focuses on the dynamic shared parking allocation problem based on PRS. A metaheuristic algorithm, namely Advanced and Adaptive Tabu Search (AATS), was designed to cope with the real-time updates of parking demands and shared parking space and to achieve good allocation effect and high allocation speed. The proposed algorithm is based on advanced initialization with multi-factor sequencing and on adaptive neighborhood generation with bi-operator competition. The results of a three-day district-level experiment show that AATS achieves an allocation effect close to the exact algorithm, while having a significant superiority in allocation speed. The proposed AATS is practical to deal with realistic parking problems.
Resource allocation problem, Allocation optimization, Rolling horizon strategy, Meta-heuristic algorithm.
Shangbin NING, Zhenzhou YUAN, Zhenyu HAN, Yang YANG, "An Advanced and Adaptive Tabu Search Algorithm for Dynamic Shared Parking Reservation and Allocation", Studies in Informatics and Control, ISSN 1220-1766, vol. 31(3), pp. 97-106, 2022. https://doi.org/10.24846/v31i3y202209
All articles published by Studies in Informatics and Control (SIC) are published in accordance with the terms and conditions of the Creative Commons Attribution License (CC BY-NC-SA 4.0).