Dynamic Space Allocation Based on Internal Demand for Optimizing Release of Shared Parking

被引:12
作者
Chou, Shuo-Yan [1 ,2 ]
Dewabharata, Anindhita [1 ]
Zulvia, Ferani Eva [3 ]
机构
[1] Natl Taiwan Univ Sci & Technol, Dept Ind Management, Taipei 106, Taiwan
[2] Natl Taiwan Univ Sci & Technol, Ctr Cyber Phys Syst Innovat, Taipei 106, Taiwan
[3] Univ Pertamina, Dept Logist Engn, Jakarta 12220, Indonesia
关键词
shared parking; shared economy; prediction; recurrent neural network; intelligent transportation system; smart cities; THINGS; MODEL;
D O I
10.3390/s22010235
中图分类号
O65 [分析化学];
学科分类号
070302 ; 081704 ;
摘要
The size of cities has been continuously increasing because of urbanization. The number of public and private transportation vehicles is rapidly increasing, thus resulting in traffic congestion, traffic accidents, and environmental pollution. Although major cities have undergone considerable development in terms of transportation infrastructure, problems caused by a high number of moving vehicles cannot be completely resolved through the expansion of streets and facilities. This paper proposes a solution for the parking problem in cities that entails a shared parking system. The primary concept of the proposed shared parking system is to release parking lots that are open to specific groups for public usage without overriding personal usage. Open-to-specific-groups parking lots consist of parking spaces provided for particular people, such as parking buildings at universities for teachers, staff, and students. The proposed shared parking system comprises four primary steps: collecting and preprocessing data by using an Internet of Things system, predicting internal demand by using a recurrent neural network algorithm, releasing several unoccupied parking lots based on prediction results, and continuously updating the real-time data to improve future internal usage prediction. Data collection and data forecasting are performed to ensure that the system does not override personal usage. This study applied several forecasting algorithms, including seasonal ARIMA, support vector regression, multilayer perceptron, convolutional neural network, long short-term memory recurrent neural network with a many-to-one structure, and long short-term memory recurrent neural network with a many-to-many structure. The proposed system was evaluated using artificial and real datasets. Results show that the recurrent neural network with the many-to-many structure generates the most accurate prediction. Furthermore, the proposed shared parking system was evaluated for some scenarios in which different numbers of parking spaces were released. Simulation results show that the proposed shared parking system can provide parking spaces for public usage without overriding personal usage. Moreover, this system can generate new income for parking management and/or parking lot owners.
引用
收藏
页数:19
相关论文
共 43 条
[1]  
Abadi M, 2016, PROCEEDINGS OF OSDI'16: 12TH USENIX SYMPOSIUM ON OPERATING SYSTEMS DESIGN AND IMPLEMENTATION, P265
[2]   Utilizing Shared Parking to Mitigate Imbalanced Supply in a Dense Urban Neighborhood Case Study in Vancouver, British Columbia, Canada [J].
Abbott, Neal T. ;
Bigazzi, Alexander Y. .
TRANSPORTATION RESEARCH RECORD, 2017, (2651) :92-100
[3]   A Balanced Algorithm for In-City Parking Allocation: A Case Study of Al Madinah City [J].
Abdeen, Mohammad A. R. ;
Nemer, Ibrahim A. ;
Sheltami, Tarek R. .
SENSORS, 2021, 21 (09)
[4]  
[Anonymous], 2002, GERMAN NATL RES CTR
[5]  
[Anonymous], 2015, P 2015 WORKSH MOB BI
[6]  
[Anonymous], 2017, An overview and comparative analysis of recurrent neural networks for short term load forecasting
[7]   Deep Machine Learning-A New Frontier in Artificial Intelligence Research [J].
Arel, Itamar ;
Rose, Derek C. ;
Karnowski, Thomas P. .
IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE, 2010, 5 (04) :13-18
[8]   An integrated model of downtown parking and traffic congestion [J].
Arnott, Richard ;
Inci, Eren .
JOURNAL OF URBAN ECONOMICS, 2006, 60 (03) :418-442
[9]   Predicting Available Parking Slots on Critical and Regular Services by Exploiting a Range of Open Data [J].
Badii, Claudio ;
Nesi, Paolo ;
Paoli, Irene .
IEEE ACCESS, 2018, 6 :44059-44071
[10]  
Bartolomeo M., 2014, HARVARD BUSINESS REV