Title: Adaptive parking demand prediction using discrete time based dynamic Markov chain
Authors: Semeneh Hunachew Bayih; Surafel Lulseged Tilahun
Addresses: Department of Mathematics, College of Natural and Computational Sciences, Arba Minch University, 21, Arba Minch, Ethiopia ' Department of Mathematics, and HPC & Big Data Analytics Center of Excellence, Addis Ababa Science and Technology University, Addis Ababa, 16417, Ethiopia; Department of Mathematics, Debark University, 90 Debark, Ethiopia
Abstract: The demand for urban parking rapidly increases and becomes a significant traffic issue in densely populated metropolitan regions. Prediction of parking demand is crucial for reducing traffic jams and decreasing greenhouse gas emissions. It is also essential to the development of parking facilities and price adjustments in urban parking planning. Most of the earlier studies developed model for parking demand prediction using historical data which lack to update the demand data. Furthermore, the demand predictions are not considering the effect of parking pricing. However, parking pricing affects the demand in a given parking platform. To address this issue, we have considered three categories of parking demand based on price based preference. Dynamic non-homogeneous Markov chain with discrete time and discrete state is used to predict the parking demand. An adaptive approach or a learning approach is proposed to make the Markov chain dynamic and to adapt changes in the demand environment. A numerical example demonstrating the prediction from data collection as well as incorporating the adaptive strategy so that the system learning new changes, is presented.
Keywords: prediction; parking demand; Markov chain model; adaptive learning; discrete time; demand categorisation.
DOI: 10.1504/IJDATS.2025.147517
International Journal of Data Analysis Techniques and Strategies, 2025 Vol.17 No.2, pp.140 - 159
Received: 13 Dec 2023
Accepted: 18 Mar 2024
Published online: 20 Jul 2025 *