Estimating parking occupancy using smart meter transaction data

The excessive search for parking, known as cruising, generates pollution and congestion. Cities are looking for approaches that will reduce the negative impact associated with searching for parking. However, adequately measuring the number of vehicles in search of parking is difficult and requires sensing technologies. In this paper, we develop an approach that eliminates the need for sensing technology by using parking meter payment transactions to estimate parking occupancy and the number of cars searching for parking. The estimation scheme is based on Particle Markov Chain Monte Carlo. We validate the performance of the Particle Markov Chain Monte Carlo approach using data simulated from a GI/GI/s queue. We show that the approach generates asymptotically unbiased Bayesian estimates of the parking occupancy and underlying model parameters such as arrival rates, average parking time, and the payment compliance rate. Finally, we estimate parking occupancy and cruising using parking meter data from SFpark, a large scale parking experiment and subsequently, compare the Particle Markov Chain Monte Carlo parking occupancy estimates against the ground truth data from the parking sensors. Our approach is easily replicated and scalable given that it only requires using data that cities already possess, namely historical parking payment transactions.

[1]  Michael I. Jordan,et al.  Bayesian inference for queueing networks and modeling of internet services , 2010, 1001.3355.

[2]  A. Doucet,et al.  Particle Markov chain Monte Carlo methods , 2010 .

[3]  Alex Demisch.  Demand-Responsive Pricing on the Cheap: Estimating Parking Occupancy with Meter Payment Data , 2016 .

[4]  Christophe Andrieu,et al.  Annealed Importance Sampling Reversible Jump MCMC Algorithms , 2013 .

[5]  P. Green.  Reversible jump Markov chain Monte Carlo computation and Bayesian model determination , 1995 .

[6]  N. Wermuth,et al.  Nonlinear Time Series : Nonparametric and Parametric Methods , 2005 .

[7]  Marco Gruteser,et al.  ParkNet: drive-by sensing of road-side parking statistics , 2010, MobiSys '10.

[8]  Nikolai Krivulin.  A recursive equations based representation for the G/G/m queue , 1994 .

[9]  P. Green,et al.  Trans-dimensional Markov chain Monte Carlo , 2000 .

[10]  D. Shoup.  Cruising for Parking , 2006 .

[11]  G. Peters,et al.  Ecological non-linear state space model selection via adaptive particle Markov chain Monte Carlo (AdPMCMC) , 2010, 1005.2238.

[12]  Michael Manville,et al.  Theory versus implementation in congestion-priced parking: An evaluation of SFpark, 2011–2012 , 2014 .

[13]  A. Doucet,et al.  A Tutorial on Particle Filtering and Smoothing: Fifteen years later , 2008 .

[14]  J. Kiefer,et al.  On the theory of queues with many servers , 1955 .

[15]  Zhen Qian,et al.  Turning meter transactions data into occupancy and payment behavioral information for on-street parking , 2017 .

[16]  N. Gordon,et al.  Novel approach to nonlinear/non-Gaussian Bayesian state estimation , 1993 .

[17]  Laurent E. Calvet,et al.  Accurate Methods for Approximate Bayesian Computation Filtering , 2015 .

[18]  Paul Marjoram,et al.  Markov chain Monte Carlo without likelihoods , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[19]  Adam Millard-Ball,et al.  Is the Curb 80% Full or 20% Empty? Assessing the Impacts of San Francisco's Parking Pricing Experiment , 2014 .

[20]  Dimitris Bertsimas,et al.  Deducing Queueing from Transactional Data: The Queue Inference Engine, Revisited , 1992, Oper. Res..

[21]  Luc Bauwens,et al.  Marginal Likelihood for Markov-Switching and Change-Point GARCH Models , 2011 .

[22]  Peter Ball,et al.  Detecting On-Street Parking Spaces in Smart Cities: Performance Evaluation of Fixed and Mobile Sensing Systems , 2018, IEEE Transactions on Intelligent Transportation Systems.

[23]  Xidong Pi,et al.  A deep learning approach to real-time parking occupancy prediction in transportation networks incorporating multiple spatio-temporal data sources , 2019, Transportation Research Part C: Emerging Technologies.

[24]  P. Moral,et al.  Branching and interacting particle systems. Approximations of Feynman-Kac formulae with applications to non-linear filtering , 2000 .

[25]  Avishai Mandelbaum,et al.  Estimating characteristics of queueing networks using transactional data , 1998, Queueing Syst. Theory Appl..

[26]  Cecilia Mascolo,et al.  ParkSense: a smartphone based sensing system for on-street parking , 2013, MobiCom.

[27]  Robert C. Hampshire,et al.  Decision Analytics for Parking Availability in Downtown Pittsburgh , 2014, Interfaces.

[28]  T. Başar,et al.  A New Approach to Linear Filtering and Prediction Problems , 2001 .

[29]  D. Balding,et al.  Approximate Bayesian computation in population genetics. , 2002, Genetics.

[30]  Robert C. Hampshire,et al.  Rethinking performance based parking pricing: A case study of SFpark , 2018 .

[31]  Richard C. Larson.  The queue inference engine: deducing queue statistics from transactional data , 1990 .

[32]  Marco Gruteser,et al.  Crowdsensing Maps of On-street Parking Spaces , 2013, 2013 IEEE International Conference on Distributed Computing in Sensor Systems.

[33]  Maria De Iorio,et al.  A Simulation Approach for Change-Points on Phylogenetic Trees , 2014, J. Comput. Biol..

[34]  Pei-Yu Lin,et al.  A Smart Roadside Parking System Using Bluetooth Low Energy Beacons , 2019, AINA Workshops.

[35]  M. Li,et al.  Particle Markov chain Monte Carlo methods , 2015 .

[36]  Sumeetpal S. Singh,et al.  Filtering via approximate Bayesian computation , 2010, Statistics and Computing.

[37]  Liping Chen,et al.  Crowdsourcing On-street Parking Space Detection , 2016, ArXiv.

[38]  G. Peters,et al.  Comments on " Particle Markov Chain Monte Carlo , 2009 .